Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
A logic-based calculus of events
New Generation Computing
Handbook of logic in artificial intelligence and logic programming (vol. 3)
A circumscriptive calculus of events
Artificial Intelligence
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Event Calculus Planning Through Satisfiability
Journal of Logic and Computation
Event Calculus Reasoning Through Satisfiability
Journal of Logic and Computation
Commonsense Reasoning
Loop formulas for circumscription
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A reductive semantics for counting and choice in answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
What is answer set programming?
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From answer set logic programming to circumscription via logic of GK
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Artificial intelligence today
Stable models and circumscription
Artificial Intelligence
On the Input Language of ASP Grounder Gringo
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Conflict-Driven Answer Set Solver clasp: Progress Report
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
System f2lp --- Computing Answer Sets of First-Order Formulas
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
On the minimality of stable models
Logic programming, knowledge representation, and nonmonotonic reasoning
First-order stable model semantics and first-order loop formulas
Journal of Artificial Intelligence Research
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
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
Integrating relational reinforcement learning with reasoning about actions and change
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
A language for default reasoning about actions
Correct Reasoning
Journal of Artificial Intelligence Research
A system for the use of answer set programming in reinforcement learning
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Interactive relational reinforcement learning of concept semantics
Machine Learning
Hi-index | 0.00 |
Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, which is, how to turn circumscription into the general stable model semantics, and based on this, how to turn circumscriptive event calculus into answer set programs. The reformulation of the event calculus in answer set programming allows answer set solvers to be applied to event calculus reasoning, handling more expressive reasoning tasks than the current SAT-based approach. Our experiments also show clear computational advantages of the answer set programming approach.