What is answer set programming to propositional satisfiability
From MaRDI portal
Recommendations
Cites work
- A machine program for theorem-proving
- A Tarskian informal semantics for answer set programming
- Abstract answer set solvers with backjumping and learning
- Abstract gringo
- Advances in WASP
- Answer set programming and plan generation
- Answer set programming based on propositional satisfiability
- ASSAT: computing answer sets of a logic program by SAT solvers
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Compiling finite domain constraints to SAT with BEE
- Computable Functions in ASP: Theory and Implementation
- Conflict-Driven Answer Set Enumeration
- Conflict-driven answer set solving: from theory to practice
- Connecting first-order ASP and the logic FO(ID) through reducts
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Extending and implementing the stable model semantics
- Extending the Smodels system with cardinality and weight constraints
- GRASP: a search algorithm for propositional satisfiability
- Handbook of constraint programming.
- scientific article; zbMATH DE number 1696830 (Why is no real title available?)
- scientific article; zbMATH DE number 25193 (Why is no real title available?)
- scientific article; zbMATH DE number 1531964 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- scientific article; zbMATH DE number 3420722 (Why is no real title available?)
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- Nested expressions in logic programs
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- On the power of clause-learning SAT solvers as resolution engines
- Planning as satisfiability: heuristics
- Planning with effectively propositional logic
- Predicate-calculus-based logics for modeling and solving search problems
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Some (in)translatability results for normal logic programs and propositional theories
- Team-building with answer set programming in the Gioia-Tauro seaport
- The DLV system for knowledge representation and reasoning
- The expressive powers of the logic programming semantics
- Theory and Applications of Satisfiability Testing
- Transition systems for model generators -- a unifying approach
- Weight constraints as nested expressions
- Why are there so many loop formulas?
- Writing declarative specifications for clauses
Cited in
(11)- Magic sets for disjunctive Datalog programs
- An abstract view on optimizations in SAT and ASP
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
- Analyzing read-once cutting plane proofs in Horn systems
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- Block structured scheduling using constraint logic programming
- AI*IA 2005: Advances in Artificial Intelligence
- An abstract view on optimizations in propositional frameworks
- Computationally hard problems for logic programs under answer set semantics
- Unit refutability of Horn constraint systems -- certification and parallel complexity
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
Describes a project that uses
Uses Software
This page was built for publication: What is answer set programming to propositional satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699519)
