444 citations
- Clausthal University of TechnologyDE1 paper
- College of Staten IslandUS1 paper
- Eötvös Loránd UniversityHU1 paper
- European UnionBE1 paper
- Hungarian Academy of SciencesHU1 paper
- HUN-REN Alfréd Rényi Institute of MathematicsHU1 paper
- Johannes Kepler University of LinzAT1 paper
- Lancaster UniversityGB1 paper
- Ludwig-Maximilians-Universität MünchenDE1 paper
- Massachusetts Institute of TechnologyUS1 paper
- Max-Born-Institute for Nonlinear Optics and Short Pulse SpectroscopyDE1 paper
- Max Planck Institute for Nuclear PhysicsDE1 paper
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2005
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
Thomas Eiter, Michael Fink, Stefan Woltran
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q unio…
cs.AI2005
Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications
Thomas Eiter, Axel Polleres
Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answe…