2308 search results - page 99 / 462 » Representing Symbolic Reasoning |
165
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
142
click to vote
CSL
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
201
click to vote
AIIA
1991
Springer
15 years 10 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
157
click to vote
AAAI
1990
15 years 7 months ago
1990
Recently, conditional logics have been developed for application to problems in default reasoning. We present a uniform framework for the development and investigation of conditio...
287
click to vote
NIL
1991
15 years 10 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.