Sciweavers

AI
2010
Springer
13 years 4 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
AI
2010
Springer
13 years 4 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
AI
2010
Springer
13 years 4 months ago
Double preference relations for generalised belief change
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...
AI
2010
Springer
13 years 4 months ago
Property persistence in the situation calculus
We develop a new automated reasoning technique for the situation calculus that can handle a class of queries containing universal quantication over situation terms. Although such ...
Ryan F. Kelly, Adrian R. Pearce
AI
2010
Springer
13 years 4 months ago
Disjunctive merging: Quota and Gmin merging operators
Patricia Everaere, Sébastien Konieczny, Pie...
AI
2010
Springer
13 years 4 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
AI
2010
Springer
13 years 4 months ago
Reasoning under inconsistency: A forgetting-based approach
In this paper, a fairly general framework for reasoning from inconsistent propositional bases is defined. Variable forgetting is used as a basic operation for weakening pieces of ...
Jérôme Lang, Pierre Marquis
AI
2010
Springer
13 years 4 months ago
Extended clause learning
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
Jinbo Huang