Sciweavers

1368 search results - page 118 / 274
» Personality-Based Practical Reasoning
Sort
View
ICLP
1997
Springer
15 years 7 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
LPNMR
1997
Springer
15 years 7 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
KR
1992
Springer
15 years 7 months ago
Abductive Plan Recognition and Diagnosis: A Comprehensive Empirical Evaluation
While it has been realized for quite some time within AI that abduction is a general model of explanation for a variety of tasks, there have been no empirical investigations into ...
Hwee Tou Ng, Raymond J. Mooney
KR
2010
Springer
15 years 7 months ago
Improving Query Answering over DL-Lite Ontologies
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
Riccardo Rosati, Alessandro Almatelli
132
Voted
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti