Sciweavers

2920 search results - page 10 / 584
» Finite information logic
Sort
View
COLING
1992
13 years 11 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
VLSID
1997
IEEE
98views VLSI» more  VLSID 1997»
14 years 2 months ago
Synthesis for Logical Initializability of Synchronous Finite State Machines
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
Montek Singh, Steven M. Nowick
CSL
2004
Springer
14 years 3 months ago
Game-Based Notions of Locality Over Finite Models
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
CADE
2008
Springer
14 years 10 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
MLQ
2008
63views more  MLQ 2008»
13 years 9 months ago
On triangular norm based axiomatic extensions of the weak nilpotent minimum logic
In this paper we carry out an algebraic investigation of the Weak Nilpotent Minimum logic (WNM) and its t-norm based axiomatic extensions. We consider the algebraic counterpart of...
Carles Noguera, Francesc Esteva, Joan Gispert