On abstract modular inference systems and solvers

DOI10.1016/j.artint.2016.03.004zbMath1357.68230arXiv1312.6151OpenAlexW2328438203MaRDI QIDQ286083

Miroslaw Truszczynski, Yuliya Lierler

Publication date: 19 May 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.6151

zbMATH Keywords

knowledge representationanswer set programmingSAT solvingautomated reasoning and inferencemodel-generation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items

Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ Stepwise debugging of answer-set programs ⋮ Reactive multi-context systems: heterogeneous reasoning in dynamic environments ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks ⋮ An abstract view on optimizations in SAT and ASP ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications

Uses Software

• Smodels
• Chaff
• DMCS
• Clingcon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relating constraint answer set programming languages and algorithms
• Answer set programming based on propositional satisfiability
• On the relation among answer set solvers
• Integrating answer set programming and constraint logic programming
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• Logic programs with stable model semantics as a constraint programming paradigm
• Abstract conflict driven learning
• Abstract answer set solvers with backjumping and learning
• A Semantic Account for Modularity in Multi-language Modelling of Search Problems
• Solving SAT and SAT Modulo Theories
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Solution Enumeration for Projected Boolean Search Problems
• A Module-Based Framework for Multi-language Constraint Modeling
• The well-founded semantics for general logic programs
• Modular Nonmonotonic Logic Programming Revisited
• Constraint Answer Set Solving
• Conflict-driven ASP solving with external sources
• The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems
• Predicate-calculus-based logics for modeling and solving search problems
• 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
• Strongly equivalent logic programs

This page was built for publication: On abstract modular inference systems and solvers