764 search results - page 12 / 153 » On the Expressibility of Stable Logic Programming |
LPNMR
2001
Springer
14 years 14 days ago
2001
Springer
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...
LPNMR
1993
Springer
14 years 4 days ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
ICLP
1999
Springer
14 years 9 days ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...