On abstract modular inference systems and solvers
From MaRDI portal
Publication:286083
DOI10.1016/J.ARTINT.2016.03.004zbMATH Open1357.68230arXiv1312.6151OpenAlexW2328438203MaRDI QIDQ286083FDOQ286083
Authors: Yuliya Lierler, Mirosław Truszczyński 
Publication date: 19 May 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Abstract: Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study general principles behind the design and analysis of model-finding programs, or solvers, for integrated heterogeneous multi-logic systems. We show how abstract modules and abstract modular systems give rise to transition systems, which are a natural and convenient representation of solvers pioneered by the SAT community. We illustrate our approach by showing how it applies to answer set programming and propositional logic, and to multi-logic systems based on these two formalisms.
Full work available at URL: https://arxiv.org/abs/1312.6151
Recommendations
answer set programmingautomated reasoning and inferenceknowledge representationmodel-generationSAT solving
Cites Work
- Extending and implementing the stable model semantics
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Modular nonmonotonic logic programming revisited
- Constraint Answer Set Solving
- Conflict-driven ASP solving with external sources
- Strongly equivalent logic programs
- Solution Enumeration for Projected Boolean Search Problems
- On the relation among answer set solvers
- Integrating answer set programming and constraint logic programming
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Extending the Smodels system with cardinality and weight constraints
- Abstract conflict driven learning
- Abstract answer set solvers with backjumping and learning
- Representing constraint satisfaction problems in answer set programming
- A semantic account for modularity in multi-language modelling of search problems
- Handbook of knowledge representation.
- Solving SAT and SAT Modulo Theories
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- A Module-Based Framework for Multi-language Constraint Modeling
- Title not available (Why is that?)
- Relating constraint answer set programming languages and algorithms
- The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems
- Predicate-calculus-based logics for modeling and solving search problems
- Title not available (Why is that?)
- Splitting on Demand in SAT Modulo Theories
- A Tarskian informal semantics for answer set programming
- Modularity Aspects of Disjunctive Stable Models
- Tableau Calculi for Answer Set Programming
- Title not available (Why is that?)
- Answer set programming based on propositional satisfiability
Cited In (7)
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Stepwise debugging of answer-set programs
- Reactive multi-context systems: heterogeneous reasoning in dynamic environments
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- A semantic account for modularity in multi-language modelling of search problems
- An abstract view on optimizations in SAT and ASP
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
Uses Software
This page was built for publication: On abstract modular inference systems and solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286083)
