Sciweavers

4573 search results - page 543 / 915
» Automated Reasoning
Sort
View
LPNMR
1993
Springer
15 years 9 months ago
Negation as Partial Failure
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...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
KR
1994
Springer
15 years 9 months ago
An Ontology of Meta-Level Categories
We focus in this paper on some meta-level ontological distinctions among unary predicates, like those between concepts and assertional properties. Three are the main contributions...
Nicola Guarino, Massimiliano Carrara, Pierdaniele ...
200
Voted
KR
1994
Springer
15 years 9 months ago
Refinement Search as a Unifying Framework for Analyzing Planning Algorithms
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
Subbarao Kambhampati
LOPSTR
1994
Springer
15 years 9 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
PLILP
1993
Springer
15 years 9 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...