Sciweavers

2911 search results - page 381 / 583
» A Logic of Graph Constraints
Sort
View
PPDP
2004
Springer
15 years 12 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
ICLP
2001
Springer
15 years 11 months ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
DAC
1999
ACM
15 years 11 months ago
Automated Phase Assignment for the Synthesis of Low Power Domino Circuits
High performance circuit techniques such as domino logic have migrated from the microprocessor world into more mainstream ASIC designs. The problem is that domino logic comes at a...
Priyadarshan Patra, Unni Narayanan
CSL
2008
Springer
15 years 8 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak