Sciweavers

1989 search results - page 59 / 398
» Set functions for functional logic programming
Sort
View
FROCOS
2005
Springer
14 years 3 months ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
Franz Baader, Silvio Ghilardi
ICLP
1995
Springer
14 years 1 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
14 years 5 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
SPLC
2008
13 years 11 months ago
Functional Testing of Feature Model Analysis Tools. A First Step
The automated analysis of Feature Models (FMs) focuses on the usage of different logic paradigms and solvers to implement a number of analysis operations on FMs. The implementatio...
Sergio Segura, David Benavides, Antonio Ruiz Cort&...
CONSTRAINTS
2008
70views more  CONSTRAINTS 2008»
13 years 10 months ago
Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
Hadrien Cambazard, Barry O'Sullivan