Sciweavers

3323 search results - page 103 / 665
» Computational Semantics with Functional Programming
Sort
View
LPNMR
1999
Springer
15 years 2 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ECOWS
2006
Springer
15 years 1 months ago
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
Frank Kaufer, Matthias Klusch
ACSD
2009
IEEE
92views Hardware» more  ACSD 2009»
15 years 4 months ago
Desynchronizing Synchronous Programs by Modes
The synchronous programming paradigm simplifies the specification and verification of reactive systems. However, synchronous programs must be often implemented on architectures...
Jens Brandt, Mike Gemunde, Klaus Schneider
SOFSEM
2004
Springer
15 years 3 months ago
Processing XPath Expressions in Relational Databases
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
Tadeusz Pankowski