246 search results - page 13 / 50 » The Truth About Defaults |
IJCAI
1989
13 years 11 months ago
1989
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
AIPS
2011
13 years 1 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
CSL
2004
Springer
14 years 3 months ago
2004
Springer
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
LPNMR
1993
Springer
14 years 1 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
AAAI
1990
13 years 11 months ago
1990
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...