Sciweavers

2540 search results - page 325 / 508
» Abstract Logics as Dialgebras
Sort
View
ESOP
1998
Springer
14 years 3 months ago
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
EACL
2006
ACL Anthology
14 years 5 days ago
XMG - An Expressive Formalism for Describing Tree-Based Grammars
In this paper1 we introduce eXtensible MetaGrammar, a system that facilitates the development of tree based grammars. This system includes both (1) a formal language adapted to th...
Yannick Parmentier, Joseph Le Roux, Benoît C...
COLING
2006
13 years 10 months ago
Geometry and Meaning
and logic defined on certain types of abstract spaces and how that intimate relationship might be exploited when applied in computational linguistics. It is also about an approach ...
C. J. van Rijsbergen
CONCUR
2009
Springer
14 years 2 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
FOIKS
2006
Springer
14 years 2 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh