Sciweavers

1445 search results - page 43 / 289
» Abstract Interpretation of Logic Programs
Sort
View
ENTCS
2008
129views more  ENTCS 2008»
14 years 9 months ago
The York Abstract Machine
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
Greg Manning, Detlef Plump
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 9 months ago
Variable elimination for building interpreters
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Julien Cohen, Jean-Louis Giavitto, Olivier Michel
CORR
2000
Springer
103views Education» more  CORR 2000»
14 years 9 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
ICANN
2009
Springer
15 years 4 months ago
Logics and Networks for Human Reasoning
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
Steffen Hölldobler, Carroline Dewi Puspa Kenc...
POPL
1992
ACM
15 years 1 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali