Sciweavers

3513 search results - page 320 / 703
» Super Logic Programs
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 3 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
CORR
2002
Springer
169views Education» more  CORR 2002»
15 years 3 months ago
On the existence and multiplicity of extensions in dialectical argumentation
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...
Bart Verheij
JLP
1998
147views more  JLP 1998»
15 years 3 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
CADE
2009
Springer
16 years 4 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
GPCE
2004
Springer
15 years 9 months ago
Splice: Aspects That Analyze Programs
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
Sean McDirmid, Wilson C. Hsieh