A circumscriptive calculus of events
Artificial Intelligence
Commonsense Reasoning
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Circumscriptive event calculus as answer set programming
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Stable models and circumscription
Artificial Intelligence
CIRC2DLP: translating circumscription into disjunctive logic programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Formalising the Fisherman's Folly puzzle
Artificial Intelligence
Functional answer set programming
Theory and Practice of Logic Programming
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
First-order extension of the FLP stable model semantics via modified circumscription
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Translating first-order theories into logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Reformulating action language C+ in answer set programming
Correct Reasoning
Relational theories with null values and non-herbrand stable models
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We present an implementation of the general language of stable models proposed by Ferraris, Lee and Lifschitz. Under certain conditions, system f2lp turns a first-order theory under the stable model semantics into an answer set program, so that existing answer set solvers can be used for computing the general language. Quantifiers are first eliminated and then the resulting quantifier-free formulas are turned into rules. Based on the relationship between stable models and circumscription, f2lp can also serve as a reasoning engine for general circumscriptive theories. We illustrate how to use f2lp to compute the circumscriptive event calculus.