Sciweavers

367 search results - page 28 / 74
» Temporal Reasoning for Procedural Programs
Sort
View
ICLP
1997
Springer
14 years 26 days 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...
ICLP
2010
Springer
14 years 3 days ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
AMAI
1999
Springer
13 years 8 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ILP
2005
Springer
14 years 2 months ago
Learning Teleoreactive Logic Programs from Problem Solving
In this paper, we focus on the problem of learning reactive skills for use by physical agents. We propose a new representation for such procedures, teleoreactive logic programs, al...
Dongkyu Choi, Pat Langley
LPNMR
2009
Springer
14 years 1 months ago
Computing Weighted Solutions in Answer Set Programming
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
Duygu Çakmak, Esra Erdem, Halit Erdogan