Sciweavers

97 search results - page 10 / 20
» A 'Natural Logic' inference system using the Lambek calculus
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
AMAI
2004
Springer
14 years 23 days ago
Production Inference, Nonmonotonicity and Abduction
We introduce a general formalism of production inference relations that posses both a standard monotonic semantics and a natural nonmonotonic semantics. The resulting nonmonotonic...
Alexander Bochman
AGI
2008
13 years 8 months ago
Probabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
Matthew Iklé, Ben Goertzel
ICFP
2003
ACM
14 years 7 months ago
Discriminative sum types locate the source of type errors
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
Matthias Neubauer, Peter Thiemann
AML
2006
120views more  AML 2006»
13 years 7 months ago
On the infinite-valued Lukasiewicz logic that preserves degrees of truth
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
Josep Maria Font, Àngel J. Gil, Antoni Torr...