What is answer set programming to propositional satisfiability
type: Item
instance of: scholarly article
title: What is answer set programming to propositional satisfiability
zbMATH Open document ID: 1423.68483
author: Yuliya Lierler
published in: Constraints
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6842941
zbMATH Keywords: propositional satisfiability
zbMATH Keywords: answer set programming
zbMATH Keywords: computational logic
describes a project that uses: Chaff
describes a project that uses: Lparse
describes a project that uses: Smodels
describes a project that uses: Cmodels
describes a project that uses: IDP
describes a project that uses: GidL
describes a project that uses: ASSAT
describes a project that uses: Potassco
describes a project that uses: MiniSat
describes a project that uses: WASP
describes a project that uses: BEE
describes a project that uses: Gringo
describes a project that uses: clasp
describes a project that uses: Clingo
describes a project that uses: iClingo
describes a project that uses: aspcud
MaRDI profile type: Publication
full work available at URL: s10601-016-9257-7
OpenAlex ID: W2304178603
Wikidata QID: Q59611995
cites work: Advances in WASP
cites work: Why are there so many loop formulas?
cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
cites work: Nested expressions in logic programs
cites work: Checking termination of bottom-up evaluation of logic programs with function symbols
cites work: Computable Functions in ASP: Theory and Implementation
cites work: A machine program for theorem-proving
cites work: Q2767097
cites work: A Tarskian Informal Semantics for Answer Set Programming
cites work: Predicate-calculus-based logics for modeling and solving search problems
cites work: Theory and Applications of Satisfiability Testing
cites work: Q3983046
cites work: Weight constraints as nested expressions
cites work: Abstract gringo
cites work: Writing Declarative Specifications for Clauses
cites work: On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
cites work: Team-building with answer set programming in the Gioia-Tauro seaport
cites work: Conflict-Driven Answer Set Enumeration
cites work: Conflict-driven answer set solving: from theory to practice
cites work: Answer set programming based on propositional satisfiability
cites work: Logic Programming
cites work: Some (in)translatability results for normal logic programs and propositional theories
cites work: Abstract answer set solvers with backjumping and learning
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: The DLV system for knowledge representation and reasoning
cites work: Compiling finite domain constraints to SAT with BEE
cites work: Transition systems for model generators—A unifying approach
cites work: Q4514010
cites work: Answer set programming and plan generation
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: Q4702577
cites work: GRASP: a search algorithm for propositional satisfiability
cites work: Planning with Effectively Propositional Logic
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Extending the Smodels system with cardinality and weight constraints
cites work: Solving SAT and SAT Modulo Theories
cites work: On the power of clause-learning SAT solvers as resolution engines
cites work: Planning as satisfiability: heuristics
cites work: Q3184605
cites work: The expressive powers of the logic programming semantics
cites work: Extending and implementing the stable model semantics
cites work: Q4798015
cites work: Connecting First-Order ASP and the Logic FO(ID) through Reducts
cites work: Q5685059
cites work: Logic Programming and Nonmonotonic Reasoning
DOI: 10.1007/S10601-016-9257-7

What is answer set programming to propositional satisfiability (DBLP publication ID)
DBLP publication ID: journals/constraints/Lierler17