Sciweavers

143 search results - page 21 / 29
» Termination of Well-Typed Logic Programs
Sort
View
LICS
1994
IEEE
13 years 11 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
JELIA
2010
Springer
13 years 5 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
CLIMA
2004
13 years 8 months ago
A Computational Model for Conversation Policies for Agent Communication
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
Jamal Bentahar, Bernard Moulin, John-Jules Ch. Mey...
POPL
2009
ACM
14 years 8 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
APLAS
2006
ACM
14 years 1 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann