Sciweavers

36 search results - page 4 / 8
» Representing Languages by Learnable Rewriting Systems
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
CAV
2001
Springer
83views Hardware» more  CAV 2001»
14 years 3 days ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
AMAST
2008
Springer
13 years 9 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
INAP
2001
Springer
14 years 1 days ago
Towards Reconciling Use Cases via Controlled Language and Graphical Models
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
Kathrin Böttger, Rolf Schwitter, Diego Moll&a...