Sciweavers

282 search results - page 46 / 57
» Propositional Fusion Rules
Sort
View
CADE
2006
Springer
14 years 7 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
FINTAL
2006
13 years 11 months ago
Morphological Lexicon Extraction from Raw Text Data
The tool extract enables the automatic extraction of lemma-paradigm pairs from raw text data. The tool uses search patterns that consist of regular expressions and propositional lo...
Markus Forsberg, Harald Hammarström, Aarne Ra...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
LFCS
2007
Springer
14 years 1 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
CADE
1998
Springer
13 years 11 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré