TY - GEN
T1 - dl2asp : implementing default logic via answer set programming
AU - Chen, Yin
AU - Wan, Hai
AU - Zhang, Yan
AU - Zhou, Yi
PY - 2010
Y1 - 2010
N2 - In this paper, we show that Reiter's default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formulas in a default theory. Based on this idea, we implement a new default logic solver - dl2asp. We report some experimental results, in particular the application of dl2asp for solving the fair division problem in social choice theory.
AB - In this paper, we show that Reiter's default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formulas in a default theory. Based on this idea, we implement a new default logic solver - dl2asp. We report some experimental results, in particular the application of dl2asp for solving the fair division problem in social choice theory.
UR - http://handle.uws.edu.au:8081/1959.7/562454
UR - http://www.jelia.eu/
U2 - 10.1007/978-3-642-15675-5_11
DO - 10.1007/978-3-642-15675-5_11
M3 - Conference Paper
SN - 9783642156755
SP - 104
EP - 116
BT - Proceedings of the 12th European Conference on Logics in Artificial Intelligence, JELIA 2010, Helsinki, Finland, September 13-15, 2010
PB - Springer
T2 - JELIA (Conference)
Y2 - 13 September 2010
ER -