4573 search results - page 642 / 915 » Automated Reasoning |
139
click to vote
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
149
click to vote
KR
1998
Springer
15 years 8 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
119
click to vote
LPNMR
1990
Springer
15 years 8 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
154
click to vote
DLOG
2008
15 years 6 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
130
click to vote
DLOG
2003
15 years 5 months ago
2003
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...