Answer set programming based on propositional satisfiability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3904558 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1319354 (Why is no real title available?)
- scientific article; zbMATH DE number 1979548 (Why is no real title available?)
- scientific article; zbMATH DE number 1531964 (Why is no real title available?)
- scientific article; zbMATH DE number 1765679 (Why is no real title available?)
- scientific article; zbMATH DE number 2085281 (Why is no real title available?)
- scientific article; zbMATH DE number 1827697 (Why is no real title available?)
- scientific article; zbMATH DE number 1890620 (Why is no real title available?)
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- scientific article; zbMATH DE number 2243377 (Why is no real title available?)
- A machine program for theorem-proving
- A structure-preserving clause form translation
- ASSAT: computing answer sets of a logic program by SAT solvers
- BerkMin: A fast and robust SAT-solver
- Bounded LTL model checking with stable models
- Computer Aided Verification
- Extending and implementing the stable model semantics
- GRASP: a search algorithm for propositional satisfiability
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic Programming
- Logic Programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- Making prolog more expressive
- Mechanizing Mathematical Reasoning
- Nested expressions in logic programs
- Propositional semantics for disjunctive logic programs
- SAT-based decision procedures for classical modal logics
- SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
- Synthesis of distributed algorithms using asynchronous automata.
- The DLV system for knowledge representation and reasoning
- The SAT-based approach to separation logic
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Weight constraints as nested expressions
Cited in
(81)- A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
- An abstract view on optimizations in propositional frameworks
- Logic programming
- Logic Programming and Nonmonotonic Reasoning
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Testing and debugging techniques for answer set solver development
- Unsatisfiable core analysis and aggregates for optimum stable model search
- Omission-based abstraction for answer set programs
- Aspmc: new frontiers of algebraic answer set counting
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Common equivalence and size of forgetting from Horn formulae
- Backdoors to tractable answer set programming
- scientific article; zbMATH DE number 5485263 (Why is no real title available?)
- Answer Set Programming with Resources
- ASSAT: computing answer sets of a logic program by SAT solvers
- Fixed point semantics for stream reasoning
- scientific article; zbMATH DE number 2090539 (Why is no real title available?)
- Probabilistic Reasoning by SAT Solvers
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Achievements in answer set programming
- Answer Set Programming’s Contributions to Classical Logic
- A dynamic-programming based ASP-solver
- Automata and Answer Set Programming
- Shared aggregate sets in answer set programming
- Answer set programs with queries over subprograms
- Complexity results for answer set programming with bounded predicate arities and implications
- On abstract modular inference systems and solvers
- Finding Reductions Automatically
- Implementing prioritized merging with ASP
- Answer Set Programming for Single-Player Games in General Game Playing
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- An abstract view on optimizations in SAT and ASP
- First-order Answer Set Programming as Constructive Proof Search
- Design and results of the second international competition on computational models of argumentation
- scientific article; zbMATH DE number 6536279 (Why is no real title available?)
- From (Quantified) Boolean Formulae to Answer Set Programming
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Backdoors to normality for disjunctive logic programs
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- Optimizing answer set computation via heuristic-based decomposition
- Prolog and ASP inference under one roof
- The Design of the Sixth Answer Set Programming Competition
- Logic Programming and Nonmonotonic Reasoning
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Answer set programming in intuitionistic logic
- Applications of intuitionistic logic in Answer Set Programming
- AI*IA 2005: Advances in Artificial Intelligence
- On Cascade Products of Answer Set Programs
- Approximate postdictive reasoning with answer set programming
- Conflict-driven ASP solving with external sources
- Design and results of the Fifth Answer Set Programming Competition
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- scientific article; zbMATH DE number 1884403 (Why is no real title available?)
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Predicate-calculus-based logics for modeling and solving search problems
- Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
- Logic Programming
- Logic Programming
- What is answer set programming to propositional satisfiability
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Iterative and core-guided maxsat solving: a survey and assessment
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- The Significance of Memory Costs in Answer Set Solver Implementation
- A characterization of answer sets for logic programs
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Abstract Answer Set Solvers
- aspartame: solving constraint satisfaction problems with answer set programming
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Answer Set Programming without Unstratified Negation
- Constraint answer set solver EZCSP and why integration schemas matter
- Computing loops with at most one external support rule for disjunctive logic programs
- Anytime answer set optimization via unsatisfiable core shrinking
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- Answer set programming with graded modality
- Progress in clasp series 3
- Loop formulas for circumscription
- Conflict-driven answer set solving: from theory to practice
This page was built for publication: Answer set programming based on propositional satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861709)
