Sciweavers

2152 search results - page 246 / 431
» On Automating the Calculus of Relations
Sort
View
CADE
2001
Springer
16 years 6 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
EDBT
2002
ACM
112views Database» more  EDBT 2002»
16 years 6 months ago
Querying with Intrinsic Preferences
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...
Jan Chomicki
DCC
2007
IEEE
16 years 6 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
CSL
2009
Springer
16 years 1 months ago
Nominal Domain Theory for Concurrency
This paper investigates a methodology of using FM (Fraenkel-Mostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a d...
David Turner, Glynn Winskel
DEXAW
2007
IEEE
137views Database» more  DEXAW 2007»
16 years 24 days ago
ENIO: An Enterprise Application Integration Ontology
If we try to increase the level of automation in Enterprise Application Integration (EAI) scenarios, we confront challenges related to the resolution of data heterogeneities, serv...
Athanasios Bouras, Panagiotis Gouvas, Gregoris Men...