The following pages link to (Q2734950):
Displaying 21 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- Computing weighted solutions in ASP: representation-based method vs. search-based method (Q421455) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- From answer set logic programming to circumscription via logic of GK (Q543597) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Answer set based design of knowledge systems (Q854966) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
- To Vladimir Lifschitz on His 65th Birthday (Q2900498) (← links)
- Toward Question Answering in Travel Domains (Q2900529) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Constraint answer set solver EZCSP and why integration schemas matter (Q4593093) (← links)
- On relation between constraint answer set programming and satisfiability modulo theories (Q4593096) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
- Twelve Definitions of a Stable Model (Q5504644) (← links)
