Sciweavers

2084 search results - page 141 / 417
» Set Constraints in Logic Programming
Sort
View
TYPES
1995
Springer
13 years 11 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
CP
2008
Springer
13 years 10 months ago
Reformulating Positive Table Constraints Using Functional Dependencies
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
Hadrien Cambazard, Barry O'Sullivan
TCAD
1998
126views more  TCAD 1998»
13 years 7 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
JUCS
2006
135views more  JUCS 2006»
13 years 8 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 ...
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
14 years 18 days ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell