Sciweavers

ALP
1997
Springer
14 years 1 months ago
Parallelizing Functional Programs by Generalization
Alfons Geser, Sergei Gorlatch
LPAR
2000
Springer
14 years 1 months ago
How to Decide Query Containment Under Constraints Using a Description Logic
Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Ste...
LPAR
2000
Springer
14 years 1 months ago
Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...
Wolfgang Grieskamp, Markus Lepper
LPAR
2000
Springer
14 years 1 months ago
On the Complexity of Theory Curbing
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
Thomas Eiter, Georg Gottlob
LPAR
2000
Springer
14 years 1 months ago
Efficient Structural Information Analysis for Real CLP Languages
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
LPAR
2000
Springer
14 years 1 months ago
A Tactic Language for the System Coq
We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recurs...
David Delahaye
LOPSTR
2000
Springer
14 years 1 months ago
Higher-order transformation of logic programs
Silvija Seres, J. Michael Spivey
LOPSTR
2000
Springer
14 years 1 months ago
A model for inter-module analysis and optimizing compilation
Francisco Bueno, Maria J. García de la Band...
LOPSTR
2000
Springer
14 years 1 months ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
LICS
2000
IEEE
14 years 1 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao