Extending and implementing the stable model semantics
From MaRDI portal
Publication:1603743
DOI10.1016/S0004-3702(02)00187-XzbMath0995.68021OpenAlexW2011124182MaRDI QIDQ1603743
Patrik Simons, Ilkka Niemelä, Timo Soininen
Publication date: 15 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00187-x
Related Items
Backdoors to Normality for Disjunctive Logic Programs, A Model for Phase Transition of Random Answer-Set Programs, Finding similar/diverse solutions in answer set programming, Parallel instantiation of ASP programs: techniques and experiments, Unnamed Item, Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells, Solution Enumeration by Optimality in Answer Set Programming, Parallel Logic Programming: A Sequel, A general framework for preferences in answer set programming, Generating explanations for biomedical queries, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Checking termination of bottom-up evaluation of logic programs with function symbols, Disjunctive answer set solvers via templates, Anytime answer set optimization via unsatisfiable core shrinking, Query answering in resource-based answer set semantics, The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description), ASPeRiX, a first-order forward chaining approach for answer set computing, Clingcon: The next generation, Constraint answer set solver EZCSP and why integration schemas matter, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Enhancing Magic Sets with an Application to Ontological Reasoning, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Partial Compilation of ASP Programs, Answer set programming made easy, Stepwise debugging of answer-set programs, Hybrid metabolic network completion, Computing Diverse Optimal Stable Models, Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Unnamed Item, Unnamed Item, Rewriting optimization statements in answer-set programs, A General Framework for Stable Roommates Problems using Answer Set Programming, Stable model semantics for founded bounds, Fuzzy answer sets approximations, Multi-threaded ASP solving with clasp, Conflict-driven ASP solving with external sources, Logic Programming for Multiagent Planning with Negotiation, Constraint Answer Set Solving, On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers, Formalizing Negotiations Using Logic Programming, Cumulativity Tailored for Nonmonotonic Reasoning, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Multi-shot ASP solving with clingo, Debugging Non-ground ASP Programs: Technique and Graphical Tools, Hybrid ASP-based Approach to Pattern Mining, Optimizing Answer Set Computation via Heuristic-Based Decomposition, Efficiently Coupling the I-DLV Grounder with ASP Solvers, ASP-Core-2 Input Language Format, Abstraction for non-ground answer set programs, Gelfond-Zhang aggregates as propositional formulas, DynASP2.5: Dynamic Programming on Tree Decompositions in Action, Answer Set Programming without Unstratified Negation, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Lparse Programs Revisited: Semantics and Representation of Aggregates, Computable Functions in ASP: Theory and Implementation, Removing Redundancy from Answer Set Programs, 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, Advances in WASP, Answer Set Programming Modulo Acyclicity, Implementing Preferences with asprin, ASP Solving for Expanding Universes, Progress in clasp Series 3, The Design of the Sixth Answer Set Programming Competition, To Vladimir Lifschitz on His 65th Birthday, Gearing Up for Effective ASP Planning, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Applying Visible Strong Equivalence in Answer-Set Program Transformations, Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming, Declarative Distributed Computing, Forward Chaining for Hybrid ASP, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Characterizations of stable model semantics for logic programs with arbitrary constraint atoms, Recursive rules with aggregation: a simple unified semantics, Answer set based design of knowledge systems, Equilibrium logic, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Shared aggregate sets in answer set programming, Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates, Scaling-up reasoning and advanced analytics on BigData, Answer set programming based on propositional satisfiability, claspfolio2: Advances in Algorithm Selection for Answer Set Programming, Vicious Circle Principle and Logic Programs with Aggregates, Improving the Normalization of Weight Rules in Answer Set 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, Many-valued dynamic object-oriented inheritance and approximations, LoCo—A Logic for Configuration Problems, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, Ordered completion for logic programs with aggregates, Clingo goes linear constraints over reals and integers, Well-founded operators for normal hybrid MKNF knowledge bases, Synonymous theories and knowledge representations in answer set programming, An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints, Solving parity games by a reduction to SAT, Logic programming as classical inference, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, Design and results of the Fifth Answer Set Programming Competition, Computing weighted solutions in ASP: representation-based method vs. search-based method, What is answer set programming to propositional satisfiability, Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination, Qualitative Constraint Enforcement in Advanced Policy Specification, Weight constraint programs with evaluable functions, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, An incremental algorithm for generating all minimal models, External sources of knowledge and value invention in logic programming, atalog: A logic language for expressing search and optimization problems, Abductive reasoning in neural-symbolic systems, Modeling biological networks by action languages via answer set programming, Rough set reasoning using answer set programs, Paracoherent answer set computation, Inferring phylogenetic trees using answer set programming, Conflict-driven answer set solving: from theory to practice, Magic sets for disjunctive Datalog programs, Logic programs with abstract constraint atoms: the role of computations, Approximation of action theories and its application to conformant planning, Stable models and circumscription, Semantics and complexity of recursive aggregates in answer set programming, A translational approach to constraint answer set solving, A program-level approach to revising logic programs under the answer set semantics, Testing and debugging techniques for answer set solver development, Automata and Answer Set Programming, Justifications for logic programs under answer set semantics, Probabilistic reasoning with answer sets, Determining inference semantics for disjunctive logic programs, Representing Production Scheduling with Constraint Answer Set Programming, Fixed point semantics for stream reasoning, Automatic network reconstruction using ASP, Complex optimization in answer set programming, Dealing Automatically with Exceptions by Introducing Specificity in ASP, Towards a Type Discipline for Answer Set Programming, Answers set programs for non-transferable utility games: expressiveness, complexity and applications, My work with Victor Marek: a mathematician looks at answer set programming, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, Some (in)translatability results for normal logic programs and propositional theories, A multiparametric view on answer set programming, Writing Declarative Specifications for Clauses, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, Vicious circle principle, aggregates, and formation of sets in ASP based languages, The theory of interval probabilistic logic programs, Computing only minimal answers in disjunctive deductive databases, Relating weight constraint and aggregate programs: Semantics and representation, Graph-based construction of minimal models, Backdoors to tractable answer set programming, Logic programming and knowledge representation---The A-Prolog perspective, Answer set programming and plan generation, Logic programming with infinite sets, A first order nonmonotonic extension of constructive logic, Domain expansion for ASP-programs with external sources, Using possibilistic logic for modeling qualitative decision: answer set programming algorithms, Reasoning with infinite stable models
Uses Software
Cites Work
- Semantical considerations on nonmonotonic logic
- The complexity of optimization problems
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Lexicographic priorities in default logic
- LOGIDATA+: deductive databases with complex objects
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Computing with default logic
- A constraint-based approach to narrow search trees for satisfiability
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programs with stable model semantics as a constraint programming paradigm
- Default reasoning using classical logic
- A rational reconstruction of nonmonotonic truth maintenance systems
- Experimental results on the crossover point in random 3-SAT
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The well-founded semantics for general logic programs
- Mixed integer programming methods for computing nonmonotonic deductive databases
- SATO: An efficient propositional prover
- A machine program for theorem-proving
- Verifying security protocols as planning in logic programming
- On computing logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item