Sciweavers

114 search results - page 5 / 23
» Partition-based logical reasoning for first-order and propos...
Sort
View
IJCAI
2001
13 years 8 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
IJCAI
2007
13 years 8 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
CADE
2005
Springer
14 years 7 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning
DLOG
2009
13 years 5 months ago
On Correspondences between Probabilistic First-Order and Description Logics
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
Pavel Klinov, Bijan Parsia, Ulrike Sattler
LORI
2009
Springer
14 years 1 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss