Pruning external minimality checking for answer set programs using semantic dependencies
From MaRDI portal
Publication:2046045
DOI10.1016/j.artint.2020.103402zbMath1504.68216OpenAlexW3093047347WikidataQ114206178 ScholiaQ114206178MaRDI QIDQ2046045
Publication date: 16 August 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103402
knowledge representationreasoninglogic programminganswer set programming with external source accesssemantic dependencies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain expansion for ASP-programs with external sources
- Relating constraint answer set programming languages and algorithms
- Semantics and complexity of recursive aggregates in answer set programming
- Backdoor sets of quantified Boolean formulas
- Number of quantifiers is better than number of tape cells
- Constrained dependencies
- Conjunctive query containment revisited
- The Hexlite solver. Lightweight and efficient evaluation of HEX programs
- Guest editorial: Special issue on answer set programming and other computing paradigms
- Complexity results for answer set programming with bounded predicate arities and implications
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- External sources of knowledge and value invention in logic programming
- OntoDLV: An ASP-based System for Enterprise Ontologies
- Modularity Aspects of Disjunctive Stable Models
- Generating explanations for biomedical queries
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- A note on succinct representations of graphs
- ASP modulo CSP: The clingcon system
- Answer Set Programming with External Source Access
- Constraint CNF: SAT and CSP Language Under One Roof.
- The DLV system for knowledge representation and reasoning
- One More Decidable Class of Finitely Ground Programs
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Experimenting with recursive queries in database and logic programming systems
- Computable Functions in ASP: Theory and Implementation
- Variable Dependencies of Quantified CSPs
This page was built for publication: Pruning external minimality checking for answer set programs using semantic dependencies