scientific article
From MaRDI portal
Publication:2734950
zbMath0979.68015MaRDI QIDQ2734950
Publication date: 30 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Supportedly stable answer sets for logic programs with generalized atoms ⋮ On abstract modular inference systems and solvers ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Toward Question Answering in Travel Domains ⋮ Answer set based design of knowledge systems ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ What is answer set programming to propositional satisfiability ⋮ Weight constraint programs with evaluable functions ⋮ Relating constraint answer set programming languages and algorithms ⋮ Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs ⋮ From answer set logic programming to circumscription via logic of GK ⋮ Thirteen Definitions of a Stable Model ⋮ Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ Twelve Definitions of a Stable Model ⋮ Extending and implementing the stable model semantics ⋮ Logic programming with infinite sets
Uses Software
This page was built for publication:
