Sciweavers

746 search results - page 12 / 150
» Connectionist Propositional Logic
Sort
View
AMAST
2006
Springer
15 years 1 months ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
ECSQARU
2009
Springer
15 years 4 months ago
Merging Qualitative Constraints Networks Using Propositional Logic
In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into ...
Jean-François Condotta, Souhila Kaci, Pierr...
LFCS
2007
Springer
15 years 4 months ago
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
IGPL
2007
75views more  IGPL 2007»
14 years 10 months ago
Fibring in the Leibniz Hierarchy
This article studies preservation of certain algebraic properties of propositional logics when combined by fibring. The logics analyzed here are classified in protoalgebraic, eq...
Víctor L. Fernández, Marcelo E. Coni...
CADE
2008
Springer
14 years 12 months ago
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
Leonardo Mendonça de Moura, Nikolaj Bj&osla...