Sciweavers

183 search results - page 11 / 37
» Applied Logic without Psychologism
Sort
View
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 7 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
ICCAD
2005
IEEE
83views Hardware» more  ICCAD 2005»
14 years 4 months ago
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
ILP
2005
Springer
14 years 1 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
APAL
2007
78views more  APAL 2007»
13 years 7 months ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
CP
2010
Springer
13 years 5 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin