Sciweavers

2981 search results - page 341 / 597
» Answer Set Planning
Sort
View
KR
2010
Springer
15 years 9 months ago
Query and Predicate Emptiness in Description Logics
Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank...
176
Voted
ASP
2001
Springer
15 years 9 months ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
146
Voted
LPNMR
2001
Springer
15 years 9 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
148
Voted
BIRTHDAY
2000
Springer
15 years 9 months ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter
144
Voted
FM
1999
Springer
104views Formal Methods» more  FM 1999»
15 years 9 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf