Sciweavers

1117 search results - page 14 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
SGAI
2007
Springer
14 years 2 months ago
Extending Jess to Handle Uncertainty
Computer scientists are often faced with the challenge of having to model the world and its associated uncertainties. One area in particular where modelling uncertainty is importa...
David Corsar, Derek H. Sleeman, Anne McKenzie
ATAL
2009
Springer
14 years 3 months ago
Agent programming with temporally extended goals
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
Koen V. Hindriks, Wiebe van der Hoek, M. Birna van...
AMAI
2008
Springer
13 years 8 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
ECAI
2000
Springer
14 years 28 days ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits