Sciweavers

180 search results - page 32 / 36
» A Default Logic Patch for Default Logic
Sort
View
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 1 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
IJCAI
1997
13 years 9 months ago
A Cumulative-Model Semantics for Dynamic Preferences on Assumptions
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
Ulrich Junker
AAAI
1990
13 years 8 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle
AMAI
2006
Springer
13 years 7 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
KI
2004
Springer
14 years 28 days ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...