Sciweavers

5378 search results - page 195 / 1076
» Base Logics in Argumentation
Sort
View
CADE
2006
Springer
16 years 7 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
ZUM
2000
Springer
15 years 10 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
JLP
1998
147views more  JLP 1998»
15 years 6 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
ECAI
2000
Springer
15 years 11 months ago
Encoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, exper...
Salem Benferhat, Didier Dubois, Souhila Kaci, Henr...
CADE
2008
Springer
16 years 7 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...