Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CL
2000
Springer
11 years 8 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
CL
2000
Springer
11 years 8 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
CL
2000
Springer
11 years 8 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
CL
2000
Springer
11 years 8 months ago
A Formal Model for an Expressive Fragment of XSLT
The extension of the XSL (eXtensible Style sheet Language) by variables and passing of data values between template rules has generated a powerful XML query language: XSLT (eXtens...
Geert Jan Bex, Sebastian Maneth, Frank Neven
CL
2000
Springer
11 years 11 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
CL
2000
Springer
11 years 11 months ago
Concurrent Constraint Programming with Process Mobility
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
David Gilbert, Catuscia Palamidessi
CL
2000
Springer
11 years 11 months ago
FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine
This paper reports on the design and implementation of FLORA -- a powerful DOOD system that incorporates the features of F-logic, HiLog, and Transaction Logic. FLORA is implemented...
Guizhen Yang, Michael Kifer
CL
2000
Springer
11 years 11 months ago
Certification of Compiler Optimizations Using Kleene Algebra with Tests
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
Dexter Kozen, Maria-Christina Patron
books