Sciweavers

2303 search results - page 220 / 461
» On the logic of argumentation theory
Sort
View
JAIR
2010
111views more  JAIR 2010»
15 years 5 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
SYNTHESE
2008
88views more  SYNTHESE 2008»
15 years 6 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
CADE
2008
Springer
16 years 7 months ago
Engineering DPLL(T) + Saturation
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
ATAL
2009
Springer
16 years 1 months ago
Unifying preference and judgment aggregation
The paper proposes a unification of the two main frameworks commonly used for the analysis of collective decisionmaking: the framework of preference aggregation, developed from t...
Davide Grossi
CIE
2007
Springer
16 years 24 days ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone