Sciweavers

746 search results - page 10 / 150
» Connectionist Propositional Logic
Sort
View
LFCS
2009
Springer
15 years 4 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
15 years 2 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 10 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
14 years 11 months ago
On the complexity of propositional logics with an involutive negation
Let C be the propositional calculus given by a standard SBL-algebra; C  is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C  i...
Zuzana Haniková
JSYML
2006
124views more  JSYML 2006»
14 years 10 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono