Sciweavers

746 search results - page 119 / 150
» Connectionist Propositional Logic
Sort
View
CSL
2007
Springer
15 years 4 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
DIAGRAMS
2004
Springer
15 years 3 months ago
Query Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with...
Frithjof Dau
AAAI
2008
15 years 10 days ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
AAAI
1994
14 years 11 months ago
Representing Multiple Theories
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
P. Pandurang Nayak
CORR
2006
Springer
131views Education» more  CORR 2006»
14 years 10 months ago
Intensional Models for the Theory of Types
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
Reinhard Muskens