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)- Graph-based construction of minimal models
- The theory of interval probabilistic logic programs
- Computing only minimal answers in disjunctive deductive databases
- Stable model semantics for founded bounds
- Many-valued dynamic object-oriented inheritance and approximations
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Rough set reasoning using answer set programs
- Answer set programming modulo acyclicity
- Paracoherent answer set semantics meets argumentation frameworks
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- Enhancing DLV instantiator by backjumping techniques
- Fixed point semantics for stream reasoning
- Generating explanations for biomedical queries
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description)
- Enhancing magic sets with an application to ontological reasoning
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- On look-ahead heuristics in disjunctive logic programming
- Abductive reasoning in neural-symbolic systems
- Debugging non-ground ASP programs: technique and graphical tools
- Automata and Answer Set Programming
- Shared aggregate sets in answer set programming
- Checking termination of bottom-up evaluation of logic programs with function symbols
- Declarative distributed computing
- Partial compilation of ASP programs
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Improving the normalization of weight rules in answer set programs
- Recursive rules with aggregation: a simple unified semantics
- A multiparametric view on answer set programming
- scientific article; zbMATH DE number 1738693 (Why is no real title available?)
- Optimizing answer set computation via heuristic-based decomposition
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- ASP-Core-2 input language format
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Formalizing negotiations using logic programming
- A model for phase transition of random answer-set programs
- Writing declarative specifications for clauses
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- What is answer set programming to propositional satisfiability
- Logic programs with abstract constraint atoms: the role of computations
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- A constraint optimization approach to causal discovery from subsampled time series data
- Causal effect identification in acyclic directed mixed graphs and gated models
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Gelfond-Zhang aggregates as propositional formulas
- Optimum stable model search: algorithms and implementation
- Paracoherent answer set computation
- Representing production scheduling with constraint answer set programming
- Determining inference semantics for disjunctive logic programs
- Stability, supportedness, minimality and Kleene answer set programs
- Justifications for logic programs under answer set semantics
- Reformulating action language \(\mathcal{C}+\) in answer set programming
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Anytime answer set optimization via unsatisfiable core shrinking
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Progress in clasp series 3
- A program-level approach to revising logic programs under the answer set semantics
- Cumulativity Tailored for Nonmonotonic Reasoning
- Backdoors to tractable answer set programming
- Weight constraint programs with evaluable functions
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Multi-threaded ASP solving with clasp
- External sources of knowledge and value invention in logic programming
- scientific article; zbMATH DE number 2088041 (Why is no real title available?)
- A first order nonmonotonic extension of constructive logic
- Vicious circle principle and logic programs with aggregates
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Advances in WASP
- Constraint Answer Set Solving
- XSB: extending Prolog with tabled logic programming
- A translational approach to constraint answer set solving
- On abstract modular inference systems and solvers
- Nested weight constraints in ASP
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- Weight constraints as nested expressions
- Stable models and circumscription
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- Synonymous theories and knowledge representations in answer set programming
- Solving parity games by a reduction to SAT
- Implementing preferences with asprin
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- Logic programming with infinite sets
- Computable Functions in ASP: Theory and Implementation
- Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
- Backdoors to normality for disjunctive logic programs
- Answer set based design of knowledge systems
- Probabilistic reasoning with answer sets
- Answer set programming based on propositional satisfiability
- The Design of the Sixth Answer Set Programming Competition
- EVOLP: An Implementation
- Removing Redundancy from Answer Set Programs
- Approximation of action theories and its application to conformant planning
- Logic programming and knowledge representation---The A-Prolog perspective
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Extending the Smodels system with cardinality and weight constraints
- A general framework for preferences in answer set programming
- Conflict-driven ASP solving with external sources
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)
