4573 search results - page 414 / 915 » Automated Reasoning |
173
Voted
LOPSTR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
197
click to vote
LPAR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
210
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...
181
click to vote
LICS
1998
IEEE
15 years 11 months ago
1998
IEEE
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
149
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...