Sciweavers

851 search results - page 98 / 171
» Inaccessibility in Decision Procedures
Sort
View
AISC
2004
Springer
14 years 2 months ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
ECAI
2004
Springer
14 years 2 months ago
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
KR
2004
Springer
14 years 2 months ago
Reaching Agreement Through Argumentation: A Possibilistic Approach
Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibili...
Leila Amgoud, Henri Prade
LOPSTR
2004
Springer
14 years 2 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 2 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad