Sciweavers

85
Voted
AI
2010
Springer
15 years 24 days ago
A logic-based axiomatic model of bargaining
Dongmo Zhang
AI
2010
Springer
15 years 24 days 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...
122
Voted
AI
2010
Springer
15 years 24 days 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
102
Voted
AI
2010
Springer
15 years 24 days 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 ...
101
Voted
AI
2010
Springer
15 years 24 days 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
67
Voted
AI
2010
Springer
15 years 24 days ago
Disjunctive merging: Quota and Gmin merging operators
Patricia Everaere, Sébastien Konieczny, Pie...
132
Voted
AI
2010
Springer
15 years 24 days 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
15 years 24 days 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
98
Voted
AI
2010
Springer
15 years 24 days 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