2519 search results - page 226 / 504 » Reasoning with Textual Cases |
177
click to vote
ESSLLI
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
203
click to vote
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Revision programming was introduced as a formalism to describe and enforce updates of belief sets and databases. Revision programming was extended by Fitting who assigned...
147
click to vote
TIME
1998
IEEE
15 years 11 months ago
1998
IEEE
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
174
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
172
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
Our concern in this paper is with conjecturing diagnoses to explain what happened to a system, given a theory of system behaviour and some observed (aberrant) behaviour. We charac...