Sciweavers

1353 search results - page 166 / 271
» Streamlined Constraint Reasoning
Sort
View
LICS
1997
IEEE
15 years 2 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
TIME
1994
IEEE
15 years 2 months ago
On the Representation of Temporal Object Roles in Object Oriented Databases
This paper outlines a generic, core temporal object model that provides support for the modeling of temporal object roles. This model draws from notions introduced in some of our ...
Niki Pissinou, Kia Makki
KR
1994
Springer
15 years 2 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
ICLP
2010
Springer
15 years 1 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
EWCBR
2000
Springer
15 years 1 months ago
Remembering Why to Remember: Performance-Guided Case-Base Maintenance
An important focus of recent CBR research is on how to develop strategies for achieving compact, competent case-bases, as a way to improve the performance of CBR systems. However, ...
David B. Leake, David C. Wilson