Sciweavers

2084 search results - page 90 / 417
» Set Constraints in Logic Programming
Sort
View
CORR
2011
Springer
187views Education» more  CORR 2011»
12 years 12 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider
POPL
2003
ACM
14 years 8 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
FPGA
2008
ACM
151views FPGA» more  FPGA 2008»
13 years 9 months ago
Beyond the arithmetic constraint: depth-optimal mapping of logic chains in LUT-based FPGAs
Look-up table based FPGAs have migrated from a niche technology for design prototyping to a valuable end-product component and, in some cases, a replacement for general purpose pr...
Michael T. Frederick, Arun K. Somani
JUCS
2010
152views more  JUCS 2010»
13 years 2 months ago
Verification of Structural Pattern Conformance Using Logic Programming
: This paper formalizes UML class diagrams and structural patterns as mathematical objects and provides a precise notion of conformance of a structural model specified as a class d...
Lunjin Lu, Dae-Kyoo Kim, Yuanlin Zhu, Sangsig Kim
POPL
2007
ACM
14 years 8 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann