Extending and implementing the stable model semantics
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1453070
- scientific article; zbMATH DE number 640290
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- On the stable model semantics for intensional functions
- A note on the stable model semantics for logic programs
- scientific article; zbMATH DE number 978242
- scientific article; zbMATH DE number 1368933
- Stable model semantics for founded bounds
- Epistemic foundation of stable model semantics
- The expressive power of unique total stable model semantics
Cites work
- scientific article; zbMATH DE number 1696839 (Why is no real title available?)
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 140412 (Why is no real title available?)
- scientific article; zbMATH DE number 1337888 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884395 (Why is no real title available?)
- scientific article; zbMATH DE number 1890620 (Why is no real title available?)
- scientific article; zbMATH DE number 1453070 (Why is no real title available?)
- scientific article; zbMATH DE number 1453071 (Why is no real title available?)
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
- A constraint-based approach to narrow search trees for satisfiability
- A logic for default reasoning
- A machine program for theorem-proving
- A rational reconstruction of nonmonotonic truth maintenance systems
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Circumscription - a form of non-monotonic reasoning
- Computing with default logic
- Default reasoning using classical logic
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Experimental results on the crossover point in random 3-SAT
- Extending the Smodels system with cardinality and weight constraints
- LOGIDATA+: deductive databases with complex objects
- Lexicographic priorities in default logic
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic programs with stable model semantics as a constraint programming paradigm
- Mixed integer programming methods for computing nonmonotonic deductive databases
- On computing logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- SATO: An efficient propositional prover
- Semantical considerations on nonmonotonic logic
- The complexity of optimization problems
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- The well-founded semantics for general logic programs
- Verifying security protocols as planning in logic programming
Cited in
(only showing first 100 items - show all)- Logic programming with infinite sets
- Domain expansion for ASP-programs with external sources
- Modeling biological networks by action languages via answer set programming
- Generating explanations for biomedical queries
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- scientific article; zbMATH DE number 1738693 (Why is no real title available?)
- Logic Programming for Multiagent Planning with Negotiation
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Declarative distributed computing
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- LoCo—A Logic for Configuration Problems
- Disjunctive answer set solvers via templates
- External sources of knowledge and value invention in logic programming
- Semantics and complexity of recursive aggregates in answer set programming
- Computable Functions in ASP: Theory and Implementation
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- scientific article; zbMATH DE number 7121940 (Why is no real title available?)
- Answer set programming modulo acyclicity
- 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
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- The Design of the Sixth Answer Set Programming Competition
- Progress in clasp series 3
- Rewriting optimization statements in answer-set programs
- Reasoning with infinite stable models
- To Vladimir Lifschitz on His 65th Birthday
- Stability, supportedness, minimality and Kleene answer set programs
- Multi-threaded ASP solving with clasp
- Equilibrium logic
- Towards a Type Discipline for Answer Set Programming
- Some (in)translatability results for normal logic programs and propositional theories
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- Synonymous theories and knowledge representations in answer set programming
- Solving parity games by a reduction to SAT
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Stepwise debugging of answer-set programs
- XSB: extending Prolog with tabled logic programming
- A new model transformation method and its application to extending a class of stability criteria of neutral type systems
- Improving the normalization of weight rules in answer set programs
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- On abstract modular inference systems and solvers
- An incremental algorithm for generating all minimal models
- Answer set based design of knowledge systems
- A program-level approach to revising logic programs under the answer set semantics
- Paracoherent answer set semantics meets argumentation frameworks
- Abstraction for non-ground answer set programs
- Rough set reasoning using answer set programs
- A first order nonmonotonic extension of constructive logic
- Stable models and circumscription
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Abductive reasoning in neural-symbolic systems
- Advances in WASP
- Answer Set Programming without Unstratified Negation
- Paracoherent answer set computation
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- EVOLP: An Implementation
- Hybrid metabolic network completion
- Computing Diverse Optimal Stable Models
- A multiparametric view on answer set programming
- Complex optimization in answer set programming
- Answer set programming based on propositional satisfiability
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- Parallel Logic Programming: A Sequel
- Automatic network reconstruction using ASP
- Formalizing negotiations using logic programming
- Weight Constraint Programs with Functions
- Logic programming
- A translational approach to constraint answer set solving
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Answer set programming made easy
- Anytime answer set optimization via unsatisfiable core shrinking
- Cumulativity Tailored for Nonmonotonic Reasoning
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Solution Enumeration by Optimality in Answer Set Programming
- Writing declarative specifications for clauses
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Clingo goes linear constraints over reals and integers
- Answer set programming and plan generation
- Qualitative Constraint Enforcement in Advanced Policy Specification
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Hybrid ASP-based approach to pattern mining
- Constraint answer set solver EZCSP and why integration schemas matter
- Recursive rules with aggregation: a simple unified semantics
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Optimum stable model search: algorithms and implementation
- Fixed point semantics for stream reasoning
- Enhancing DLV instantiator by backjumping techniques
- A general framework for preferences in answer set programming
- scientific article; zbMATH DE number 7453147 (Why is no real title available?)
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Ordered completion for logic programs with aggregates
This page was built for publication: Extending and implementing the stable model semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603743)
