Sciweavers

10 search results - page 2 / 2
» lpnmr 2001
Sort
View
LPNMR
2001
Springer
13 years 8 months ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
LPNMR
2001
Springer
13 years 8 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ä
LPNMR
2001
Springer
13 years 8 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
LPNMR
2001
Springer
13 years 8 months ago
Multi-dimensional Dynamic Knowledge Representation
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
João Alexandre Leite, José Jú...
LPNMR
2001
Springer
13 years 8 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits