scientific article; zbMATH DE number 1453071
From MaRDI portal
Publication:4955344
zbMath0952.68029MaRDI QIDQ4955344
Timo Soininen, Patrik Simons, Ilkka Niemelä
Publication date: 25 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Supportedly stable answer sets for logic programs with generalized atoms ⋮ Strong Equivalence of RASP Programs ⋮ Disjunctive Programs with Set Constraints ⋮ Argumentation-Based Semantics for Logic Programs with First-Order Formulae ⋮ Answer Set Programming for Single-Player Games in General Game Playing ⋮ Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ RASP and ASP as a fragment of linear logic ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Computing weighted solutions in ASP: representation-based method vs. search-based method ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ Rough set reasoning using answer set programs ⋮ Automated verification of state sequence invariants in general game playing ⋮ Fixed point semantics for stream reasoning ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Quo Vadis Answer Set Programming? ⋮ Answer Set Programming without Unstratified Negation ⋮ Fixed-parameter complexity in AI and nonmonotonic reasoning ⋮ Extending and implementing the stable model semantics ⋮ Logic programming with infinite sets
Uses Software
This page was built for publication:
