Sciweavers

1549 search results - page 154 / 310
» On the rules of intermediate logics
Sort
View
JUCS
2006
135views more  JUCS 2006»
13 years 9 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
DAC
2010
ACM
13 years 10 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
APAL
2007
78views more  APAL 2007»
13 years 9 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
TACS
1994
Springer
14 years 1 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
LICS
1990
IEEE
14 years 1 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter