On abstract modular inference systems and solvers
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 6747884 (Why is no real title available?)
- scientific article; zbMATH DE number 5043340 (Why is no real title available?)
- A Module-Based Framework for Multi-language Constraint Modeling
- A Tarskian informal semantics for answer set programming
- A semantic account for modularity in multi-language modelling of search problems
- Abstract answer set solvers with backjumping and learning
- Abstract conflict driven learning
- Answer set programming based on propositional satisfiability
- Conflict-driven ASP solving with external sources
- Conflict-driven answer set solving: from theory to practice
- Constraint Answer Set Solving
- Extending and implementing the stable model semantics
- Extending the Smodels system with cardinality and weight constraints
- Handbook of knowledge representation.
- Integrating answer set programming and constraint logic programming
- Logic programs with stable model semantics as a constraint programming paradigm
- Modular nonmonotonic logic programming revisited
- Modularity Aspects of Disjunctive Stable Models
- On the relation among answer set solvers
- Predicate-calculus-based logics for modeling and solving search problems
- Relating constraint answer set programming languages and algorithms
- Representing constraint satisfaction problems in answer set programming
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Solution Enumeration for Projected Boolean Search Problems
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Splitting on Demand in SAT Modulo Theories
- Strongly equivalent logic programs
- Tableau Calculi for Answer Set Programming
- The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems
- The well-founded semantics for general logic programs
Cited in
(7)- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- 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
- Reactive multi-context systems: heterogeneous reasoning in dynamic environments
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Stepwise debugging of answer-set programs
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)
