Sciweavers

17298 search results - page 3402 / 3460
» Abstract computing machines
Sort
View
CTRS
1990
14 years 2 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
FPCA
1989
14 years 2 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
PODS
1989
ACM
129views Database» more  PODS 1989»
14 years 2 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
COBUILD
1998
Springer
14 years 2 months ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...
CICLING
2010
Springer
14 years 2 months ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
« Prev « First page 3402 / 3460 Last » Next »