802 citations
- Heidelberg UniversityDE8 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- Clausthal University of TechnologyDE4 papers
- University of Science and Technology of ChinaCN4 papers
- University of ViennaAT4 papers
- Hebrew University of JerusalemIL3 papers
- Yale UniversityUS3 papers
- Astronomical Institute of the Slovak Academy of SciencesSK2 papers
- Ben-Gurion University of the NegevIL2 papers
- College of Staten IslandUS2 papers
- ETH ZurichCH2 papers
- European Organization for Nuclear ResearchCH2 papers
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…