Sciweavers

4126 search results - page 216 / 826
» Set based logic programming
Sort
View
ICLP
2007
Springer
16 years 20 days ago
Demand-Driven Indexing of Prolog Clauses
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
Vítor Santos Costa, Konstantinos F. Sagonas...
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 8 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
CL
2000
Springer
15 years 11 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
POPL
2006
ACM
16 years 6 months ago
Specifying C++ concepts
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
Gabriel Dos Reis, Bjarne Stroustrup
LICS
1989
IEEE
15 years 10 months ago
Negation As Refutation
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
Melvin Fitting