Expressiveness of communication in answer set programming
From MaRDI portal
Publication:5298798
DOI10.1017/S1471068411000561zbMath1266.68080arXiv1109.2434OpenAlexW1970330818MaRDI QIDQ5298798
Steven Schockaert, Dirk Vermeir, Kim Bauters, Jeroen Janssen, Martine De Cock
Publication date: 14 June 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2434
Cites Work
- Unnamed Item
- Multilanguage hierarchical logics, or: How we can do without modal logics
- The computational complexity of propositional STRIPS planning
- Answer set programming and plan generation
- Nested expressions in logic programs
- Combining answer set programming with description logics for the semantic web
- A lattice-theoretical fixpoint theorem and its applications
- The polynomial hierarchy and a simple model for competitive analysis
- The complexity of logic-based abduction
- Knowledge Representation, Reasoning and Declarative Problem Solving
This page was built for publication: Expressiveness of communication in answer set programming