Sciweavers

226 search results - page 44 / 46
» BDDs and Automated Deduction
Sort
View
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
WOLLIC
2009
Springer
14 years 2 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
JCDL
2006
ACM
161views Education» more  JCDL 2006»
14 years 1 months ago
Learning metadata from the evidence in an on-line citation matching scheme
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
Isaac G. Councill, Huajing Li, Ziming Zhuang, Sand...
KR
2004
Springer
14 years 29 days ago
Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription
Humans have always done nonmonotonic reasoning, but rigorous monotonic reasoning in reaching given conclusions has been deservedly more respected and admired. Euclid contains the ...
John McCarthy
MATES
2004
Springer
14 years 29 days ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen