Sciweavers

159 search results - page 21 / 32
» Complete Laziness: a Natural Semantics
Sort
View
TABLEAUX
2009
Springer
14 years 1 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
AMAST
2006
Springer
14 years 22 days ago
Realizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic spec...
Arjan J. Mooij, Judi Romijn, Wieger Wesselink
ISMIS
2000
Springer
14 years 17 days ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
FPL
2006
Springer
223views Hardware» more  FPL 2006»
14 years 19 days ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
ENTCS
2008
106views more  ENTCS 2008»
13 years 9 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...