Sciweavers

152 search results - page 17 / 31
» Memory-Efficient Inference in Relational Domains
Sort
View
IJCAI
1993
14 years 11 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
AIM
2005
14 years 9 months ago
Description Logics and Planning
This paper surveys previous work on combining planning techniques with expressive representations of knowledge in description logics to reason about tasks, plans, and goals. Descr...
Yolanda Gil
SAS
2007
Springer
15 years 4 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
ICLP
2001
Springer
15 years 2 months ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
MEDINFO
2007
116views Healthcare» more  MEDINFO 2007»
14 years 11 months ago
Knowledge-Level Querying of Temporal Patterns in Clinical Research Systems
Managing time-stamped data is essential to clinical research activities and often requires the use of considerable domain knowledge, which is difficult to support within database ...
Martin J. O'Connor, Ravi D. Shankar, David B. Parr...