Pages that link to "Item:Q1978008"
From MaRDI portal
The following pages link to Logic programs with stable model semantics as a constraint programming paradigm (Q1978008):
Displayed 39 items.
- Logic programming with infinite sets (Q812390) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Nonmonotonic causal theories (Q814551) (← links)
- Heuristic planning: A declarative approach based on strategies for action selection (Q814564) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Strong order equivalence (Q854968) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Modeling biological networks by action languages via answer set programming (Q941667) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- Consistency properties and set based logic programming (Q1028650) (← links)
- Stable models and difference logic (Q1028651) (← links)
- Inductive situation calculus (Q1028914) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- Set based logic programming (Q1029592) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Answer set programming and plan generation (Q1603732) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- Strongly Equivalent Temporal Logic Programs (Q3532454) (← links)
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability (Q3534675) (← links)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs (Q3546042) (← links)
- Automata and Answer Set Programming (Q3605538) (← links)
- Justifications for logic programs under answer set semantics (Q3612602) (← links)
- On finitely recursive programs (Q3621269) (← links)
- Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (Q5458423) (← links)
- SMS and ASP: Hype or TST? (Q5504647) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- Answer Set Programming without Unstratified Negation (Q5504649) (← links)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) (← links)
- Lparse Programs Revisited: Semantics and Representation of Aggregates (Q5504666) (← links)
- Relativized Hyperequivalence of Logic Programs for Modular Programming (Q5504681) (← links)