Sciweavers

226 search results - page 7 / 46
» A Language for the Compact Representation of Multiple Progra...
Sort
View
IJPRAI
2000
108views more  IJPRAI 2000»
13 years 7 months ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 4 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
PLDI
1997
ACM
13 years 11 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham
CICLING
2007
Springer
14 years 1 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner
ARTMED
2010
119views more  ARTMED 2010»
13 years 7 months ago
Fuzzy Arden Syntax: A fuzzy programming language for medicine
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
Thomas Vetterlein, Harald Mandl, Klaus-Peter Adlas...