Pruning external minimality checking for answer set programs using semantic dependencies
From MaRDI portal
Publication:2046045
Recommendations
- Pruning external minimality checking for ASP using semantic dependencies
- Exploiting partial assignments for efficient evaluation of answer set programs with external source access
- Answer set programming with external sources
- Conflict-driven ASP solving with external sources
- Answer set programming with external source access
Cites work
- A note on succinct representations of graphs
- Answer set programming with external source access
- ASP modulo CSP: the clingcon system
- Backdoor sets of quantified Boolean formulas
- Complexity results for answer set programming with bounded predicate arities and implications
- Computable Functions in ASP: Theory and Implementation
- Conjunctive query containment revisited
- Constrained dependencies
- Constraint CNF: SAT and CSP Language Under One Roof.
- Domain expansion for ASP-programs with external sources
- Efficient HEX-Program Evaluation Based on Unfounded Sets
- Experimenting with recursive queries in database and logic programming systems
- Exploiting partial assignments for efficient evaluation of answer set programs with external source access
- External sources of knowledge and value invention in logic programming
- Generating explanations for biomedical queries
- Guest editorial: Special issue on answer set programming and other computing paradigms
- Handbook of constraint programming.
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- scientific article; zbMATH DE number 1696839 (Why is no real title available?)
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1759629 (Why is no real title available?)
- scientific article; zbMATH DE number 7030641 (Why is no real title available?)
- scientific article; zbMATH DE number 4118333 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- Modularity aspects of disjunctive stable models
- Number of quantifiers is better than number of tape cells
- One More Decidable Class of Finitely Ground Programs
- OntoDLV: An ASP-based System for Enterprise Ontologies
- Probabilistic graphical models.
- Relating constraint answer set programming languages and algorithms
- Semantics and complexity of recursive aggregates in answer set programming
- The computational complexity of dominance and consistency in CP-nets
- The DLV system for knowledge representation and reasoning
- The Hexlite solver. Lightweight and efficient evaluation of HEX programs
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- Variable Dependencies of Quantified CSPs
Describes a project that uses
Uses Software
This page was built for publication: Pruning external minimality checking for answer set programs using semantic dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046045)
