Inlining External Sources in Answer Set Programs
From MaRDI portal
Publication:4957183
DOI10.1017/S147106841800056XzbMath1472.68027arXiv1808.00727MaRDI QIDQ4957183
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.00727
68N17: Logic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain expansion for ASP-programs with external sources
- Semantics and complexity of recursive aggregates in answer set programming
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Exploiting conjunctive queries in description logic programs
- Conflict-driven answer set solving: from theory to practice
- Propagation via lazy clause generation
- A general notion of equivalence for abstract argumentation
- Combining answer set programming with description logics for the semantic web
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
- Answer Set Programming: A Primer
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- A model building framework for answer set programming with external computations
- Constraint Answer Set Solving
- ASP modulo CSP: The clingcon system
- Conflict-driven ASP solving with external sources
- Logic Programming
- Logics in Artificial Intelligence
- Answer Set Solving with Lazy Nogood Generation
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Logic Programming and Nonmonotonic Reasoning
- Computer Aided Verification
- Strongly equivalent logic programs
