Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Meta-level programming and knowledge representation
New Generation Computing
Nonmonotonic logic and temporal projection
Artificial Intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Logic programming
Theoretical Computer Science
Temporal reasoning in logic programming: a case for the situation calculus
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Complexity, decidability and undecidability results for domain-independent planning
Artificial Intelligence - Special volume on planning and scheduling
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial time query processing in temporal deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The aditi deductive database system
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
Active Database Rules with Transaction-Conscious Stable-Model Semantics
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Nonmonotonic reasoning in LDL++
Logic-based artificial intelligence
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
Nondeterministic, Nonmonotonic Logic Databases
IEEE Transactions on Knowledge and Data Engineering
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Verification in Logic Database Languages
CL '00 Proceedings of the First International Conference on Computational Logic
The deductive database system ℒ𝒟ℒ++
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
The problem of finding effective logic-based formalizations for problems involving actions remains one of the main application challenges of non-monotonic knowledge representation. In this paper, we show that complex planning strategies find natural logic-based formulations and efficient implementations in the framework of deductive database languages. We begin by modeling classical STRIPS-like totally ordered plans by means of Datalog_{1S} programs, and show that these programs have a stable model semantics that is also amenable to efficient computation. We then show that the proposed approach is quite expressive and flexible, and can also model partially ordered plans, which are abstract plans whereby each plan stands for a whole class of totally ordered plans. This results in a reduction of the search space and a subsequent improvement in efficiency.