Logic programs with stable model semantics as a constraint programming paradigm
From MaRDI portal
Publication:1978008
DOI10.1023/A:1018930122475zbMath0940.68018WikidataQ60061161 ScholiaQ60061161MaRDI QIDQ1978008
Publication date: 7 June 2000
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Backdoors to Normality for Disjunctive Logic Programs ⋮ Strong Equivalence of Logic Programs with Counting ⋮ Cautious reasoning in ASP via minimal models and unsatisfiable cores ⋮ Argumentation-Based Semantics for Logic Programs with First-Order Formulae ⋮ Temporal equilibrium logic: a survey ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Temporal Equilibrium Logic with past operators ⋮ Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation ⋮ Fifty Years of Prolog and Beyond ⋮ A general framework for preferences in answer set programming ⋮ Achievements in answer set programming ⋮ Generating explanations for biomedical queries ⋮ Fuzzy answer set computation via satisfiability modulo theories ⋮ A denotational semantics for equilibrium logic ⋮ An infinitary encoding of temporal equilibrium logic ⋮ A model building framework for answer set programming with external computations ⋮ Disjunctive answer set solvers via templates ⋮ Anytime answer set optimization via unsatisfiable core shrinking ⋮ Stable-unstable semantics: Beyond NP with normal logic programs ⋮ Justifications for programs with disjunctive and causal-choice rules ⋮ Temporal logic programs with variables ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ CASP solutions for planning in hybrid domains ⋮ Solving distributed constraint optimization problems using logic programming ⋮ Thirty years of Epistemic Specifications ⋮ Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics ⋮ Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ Revisiting Explicit Negation in Answer Set Programming ⋮ Stepwise debugging of answer-set programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. ⋮ A compositional typed higher-order logic with definitions ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming ⋮ Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming ⋮ Disjunctive logic programs with existential quantification in rule heads ⋮ Fuzzy answer sets approximations ⋮ Answer set programming as a modeling language for course timetabling ⋮ Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach ⋮ D-FLAT: Declarative problem solving using tree decompositions and answer-set programming ⋮ Relational theories with null values and non-herbrand stable models ⋮ Conflict-driven ASP solving with external sources ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ Formalizing Negotiations Using Logic Programming ⋮ Explaining Preferences and Preferring Explanations ⋮ Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks ⋮ Unnamed Item ⋮ Syntactic ASP forgetting with forks ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders ⋮ Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming ⋮ Model-Based Knowledge Representation and Reasoning Via Answer Set Programming ⋮ Preface ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ SMS and ASP: Hype or TST? ⋮ Quo Vadis Answer Set Programming? ⋮ Answer Set Programming without Unstratified Negation ⋮ Detecting Inconsistencies in Large Biological Networks with Answer Set Programming ⋮ Lparse Programs Revisited: Semantics and Representation of Aggregates ⋮ Relativized Hyperequivalence of Logic Programs for Modular Programming ⋮ Abduction in logic programming: A new definition and an abductive procedure based on rewriting ⋮ On abstract modular inference systems and solvers ⋮ XSB: Extending Prolog with Tabled Logic Programming ⋮ Stable Models for Temporal Theories ⋮ Performance Tuning in Answer Set Programming ⋮ Enablers and Inhibitors in Causal Justifications of Logic Programs ⋮ Diagnostic Reasoning for Robotics Using Action Languages ⋮ The Design of the Sixth Answer Set Programming Competition ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Causal Logic Programming ⋮ Applications of Action Languages in Cognitive Robotics ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Backdoors to Satisfaction ⋮ Representing first-order causal theories by logic programs ⋮ Characterizations of stable model semantics for logic programs with arbitrary constraint atoms ⋮ Strong order equivalence ⋮ Possibilistic uncertainty handling for answer set programming ⋮ Answer set programming based on propositional satisfiability ⋮ Anytime Computation of Cautious Consequences in Answer Set Programming ⋮ Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Three-valued semantics for hybrid MKNF knowledge bases revisited ⋮ Causal effect identification in acyclic directed mixed graphs and gated models ⋮ A constraint optimization approach to causal discovery from subsampled time series data ⋮ A progression semantics for first-order logic programs ⋮ Ordered completion for logic programs with aggregates ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Extending Removed Sets Revision to partially preordered belief bases ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ Ordered completion for first-order logic programs on finite structures ⋮ What is answer set programming to propositional satisfiability ⋮ How to fake an RSA signature by encoding modular root finding as a SAT problem ⋮ Extended RDF: computability and complexity issues ⋮ Syntactic ASP forgetting with forks
Uses Software
This page was built for publication: Logic programs with stable model semantics as a constraint programming paradigm
