4573 search results - page 404 / 915 » Automated Reasoning |
209
click to vote
ASP
2001
Springer
15 years 11 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...
181
click to vote
ASP
2001
Springer
15 years 11 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...
200
click to vote
ASP
2001
Springer
15 years 11 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...
148
click to vote
CSL
2001
Springer
15 years 11 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...
208
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...