CSL
2001
Springer
14 years 4 months ago
2001
Springer
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
ASP
2001
Springer
14 years 4 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
ASP
2001
Springer
14 years 4 months ago
2001
Springer
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...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
ASP
2001
Springer
14 years 4 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
ASP
2001
Springer
14 years 4 months ago
2001
Springer
This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...