3572 search results - page 109 / 715 » Nominal Logic Programming |
191
Voted
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
106
Voted
POPL
1994
ACM
15 years 4 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
130
Voted
CADE
2005
Springer
16 years 29 days ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
84
Voted
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
We pursue a representation of logic programs as classical first-order sentences. Different semantics for logic programs can then be expressed by the way in which they are wrapped...
100
click to vote
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...