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
- 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
- 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?)
- 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
- LOGIDATA+: deductive databases with complex objects
- 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)- 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
- The theory of interval probabilistic logic programs
- Computing only minimal answers in disjunctive deductive databases
- Logic programming and knowledge representation---The A-Prolog perspective
- Answer set programming and plan generation
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- 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
- What is answer set programming to propositional satisfiability
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Fixed point semantics for stream reasoning
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Graph-based construction of minimal models
- Recursive rules with aggregation: a simple unified semantics
- Rough set reasoning using answer set programs
- Paracoherent answer set computation
- Determining inference semantics for disjunctive logic programs
- A multiparametric view on answer set programming
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Backdoors to tractable answer set programming
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- 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
- \textsc{lp2normal} -- a normalization tool for extended logic programs
- On look-ahead heuristics in disjunctive logic programming
- Enhancing DLV instantiator by backjumping techniques
- An incremental algorithm for generating all minimal models
- External sources of knowledge and value invention in logic programming
- Abductive reasoning in neural-symbolic systems
- Inferring phylogenetic trees using answer set programming
- Domain expansion for ASP-programs with external sources
- Many-valued dynamic object-oriented inheritance and approximations
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
- Extending the Smodels system with cardinality and weight constraints
- Representing production scheduling with constraint answer set programming
- Writing declarative specifications for clauses
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Nested weight constraints in ASP
- Relating weight constraint and aggregate programs: semantics and representation
- On abstract modular inference systems and solvers
- XSB: extending Prolog with tabled logic programming
- 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
- 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
- LoCo—A Logic for Configuration Problems
- Automatic network reconstruction using ASP
- Complex optimization in answer set programming
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Optimum stable model search: algorithms and implementation
- 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
- Forward chaining for hybrid ASP
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Qualitative Constraint Enforcement in Advanced Policy Specification
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- 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
- EVOLP: An Implementation
- Automata and Answer Set Programming
- Justifications for logic programs under answer set semantics
- Probabilistic reasoning with answer sets
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- Towards a Type Discipline for Answer Set Programming
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- Weight Constraint Programs with Functions
- Some (in)translatability results for normal logic programs and propositional theories
- 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
- Computing weighted solutions in ASP: representation-based method vs. search-based method
- scientific article; zbMATH DE number 1738693 (Why is no real title available?)
- 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
- Clingo goes linear constraints over reals and integers
- Well-founded operators for normal hybrid MKNF knowledge bases
- 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
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)
