Logic programs with stable model semantics as a constraint programming paradigm

Recommendations

scientific article; zbMATH DE number 1368933
A note on the stable model semantics for logic programs
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
The Stable Models of a Predicate Logic Program
Expressiveness of logic programs under the general stable model semantics
The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
On stable-like semantics for logic programs
scientific article; zbMATH DE number 1114052
Stable models and their computation for logic programming with inheritance and true negation
scientific article; zbMATH DE number 2084772

Cited in

(only showing first 100 items - show all)

Infinitary equilibrium logic and strongly equivalent logic programs
Logic programming with infinite sets
Equilibrium graphs
Modeling biological networks by action languages via answer set programming
Transition systems for model generators -- a unifying approach
Generating explanations for biomedical queries
scientific article; zbMATH DE number 1884395 (Why is no real title available?)
Argumentation-based semantics for logic programs with first-order formulae
Explaining preferences and preferring explanations
Reduction-based approaches to implement Modgil's extended argumentation frameworks
Temporal equilibrium logic: a survey
A model building framework for answer set programming with external computations
scientific article; zbMATH DE number 7552283 (Why is no real title available?)
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
Logics in Artificial Intelligence
On the relation between SPARQL1.1 and Answer Set Programming
D-FLAT: declarative problem solving using tree decompositions and answer-set programming
Disjunctive answer set solvers via templates
Compiling problem specifications into SAT
A note on the stable model semantics for logic programs
IASCAR: incremental answer set counting by anytime refinement
Stable Models for Temporal Theories
\textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
Logic programs with abstract constraint atoms: the role of computations
Automata and Answer Set Programming
My work with Victor Marek: a mathematician looks at answer set programming
The Design of the Sixth Answer Set Programming Competition
Relativized hyperequivalence of logic programs for modular programming
Causal Logic Programming
To Vladimir Lifschitz on His 65th Birthday
Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics
Answer Set Programming: A Primer
Some (in)translatability results for normal logic programs and propositional theories
Ordered completion for first-order logic programs on finite structures
Stepwise debugging of answer-set programs
Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis
Stable-unstable semantics: Beyond NP with normal logic programs
XSB: extending Prolog with tabled logic programming
Anytime computation of cautious consequences in answer set programming
Improving the normalization of weight rules in answer set programs
The dramatic true story of the frame default
On abstract modular inference systems and solvers
From answer set logic programming to circumscription via logic of GK
A modeling layer for constraint-programming libraries
Loop formulas for description logic programs
Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
ICCMA 2023: 5th international competition on computational models of argumentation
Strong order equivalence
An approach from answer set programming to decision making in a railway interlocking system
Model-Based Knowledge Representation and Reasoning Via Answer Set Programming
A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
Disjunctive logic programs with existential quantification in rule heads
Stable models and circumscription
How to fake an RSA signature by encoding modular root finding as a SAT problem
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
The XAI system for answer set programming xASP2
Answer Set Programming without Unstratified Negation
Automated reformulation of specifications by safe delay of constraints
Thirty years of Epistemic Specifications
Direct encoding of declare constraints in ASP
Stable models and difference logic
Extending and implementing the stable model semantics
scientific article; zbMATH DE number 7455713 (Why is no real title available?)
Achievements in answer set programming
A compositional typed higher-order logic with definitions
scientific article; zbMATH DE number 1696768 (Why is no real title available?)
Answer set programming based on propositional satisfiability
Abstract Solvers for Computing Cautious Consequences of ASP programs
Applications of action languages in cognitive robotics
A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
Evaluating ASP and commercial solvers on the CSPLib
Strongly Equivalent Temporal Logic Programs
Integrating answer set programming and constraint logic programming
On the relation among answer set solvers
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
The Seventh Answer Set Programming Competition: Design and Results
Formalizing negotiations using logic programming
Fuzzy answer set computation via satisfiability modulo theories
Logic programming
Backdoors to satisfaction
Positive dependency graphs revisited
Specifying and reasoning about CPS through the lens of the NIST CPS framework
Aggregate semantics for propositional answer set programs
A brief history of updates of answer-set programs
Constraint answer set programming: integrational and translational (or SMT-based) approaches
A translational approach to constraint answer set solving
scientific article; zbMATH DE number 2080548 (Why is no real title available?)
A denotational semantics for equilibrium logic
Anytime answer set optimization via unsatisfiable core shrinking
Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
Relational theories with null values and non-Herbrand stable models
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
CASP solutions for planning in hybrid domains
{\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Quo Vadis Answer Set Programming?
Relativized Hyperequivalence of Logic Programs for Modular Programming
On logical constraints in logic programming
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Answer set programming and plan generation

Describes a project that uses

Uses Software

Graphplan
Smodels
NP-SPEC

This page was built for publication: Logic programs with stable model semantics as a constraint programming paradigm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978008)