Sciweavers

3776 search results - page 338 / 756
» Partition-Based Logical Reasoning
Sort
View
LICS
2003
IEEE
15 years 10 months ago
Model-checking Trace Event Structures
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
P. Madhusudan
SLOGICA
2011
14 years 11 months ago
Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
Ofer Arieli, Arnon Avron, Anna Zamansky
JAR
2010
95views more  JAR 2010»
14 years 11 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
LPNMR
1997
Springer
15 years 9 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
CADE
2008
Springer
16 years 5 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...