275 search results - page 37 / 55 » Non-Termination Inference of Logic Programs |
KR
1998
Springer
15 years 1 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
VLDB
1990
ACM
15 years 1 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
174
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
UIST
2003
ACM
15 years 3 months ago
2003
ACM
This paper offers a solution to the mode problem in computer sketch/notetaking programs. Conventionally, the user must specify the intended "draw" or "command"...
123
click to vote
UAI
1997
14 years 11 months ago
1997
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...