Extending and implementing the stable model semantics
type: Item
instance of: scholarly article
title: Extending and implementing the stable model semantics
zbMATH Open document ID: 0995.68021
DOI: 10.1016/S0004-3702(02)00187-X
author: Patrik Simons
author: Ilkka Niemelä
author: Timo Soininen
published in: Artificial Intelligence
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1767935
zbMATH Keywords: answer set programming
zbMATH Keywords: logic programs
zbMATH Keywords: stable model semantics
zbMATH Keywords: weight constraints
zbMATH Keywords: optimization
describes a project that uses: NP-SPEC
describes a project that uses: Smodels
describes a project that uses: SATO
describes a project that uses: GraphBase
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Verifying security protocols as planning in logic programming
cites work: Mixed integer programming methods for computing nonmonotonic deductive databases
cites work: Default reasoning using classical logic
cites work: Computing with default logic
cites work: Experimental results on the crossover point in random 3-SAT
cites work: A machine program for theorem-proving
cites work: On computing logic programs
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: A rational reconstruction of nonmonotonic truth maintenance systems
cites work: Q4800163
cites work: Q4264234
cites work: Q3140399
cites work: The complexity of optimization problems
cites work: LOGIDATA+: deductive databases with complex objects
cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
cites work: A constraint-based approach to narrow search trees for satisfiability
cites work: Q5750390
cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs
cites work: Q4702577
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Semantical considerations on nonmonotonic 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: Q4955344
cites work: Q3221403
cites work: Q4028824
cites work: Q3983045
cites work: A logic for default reasoning
cites work: Lexicographic priorities in default logic
cites work: An alternative approach to the semantics of disjunctive logic programs and deductive databases
cites work: Q4955343
cites work: Q2767109
cites work: Q4798015
cites work: The well-founded semantics for general logic programs
cites work: SATO: An efficient propositional prover
full work available at URL: s0004-3702(02)00187-x
OpenAlex ID: W2011124182
Recommended article: Q4955343
Recommended article: Q4306224
Recommended article: Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
Recommended article: On the stable model semantics for intensional functions
Recommended article: A note on the stable model semantics for logic programs
Recommended article: Q4332418
Recommended article: Q4702577
Recommended article: Stable model semantics for founded bounds
Recommended article: Epistemic foundation of stable model semantics
Recommended article: The expressive power of unique total stable model semantics
description: scientific article; zbMATH DE number 1767935