Sciweavers

1054 search results - page 25 / 211
» A Logic Language of Granular Computing
Sort
View
ALP
1997
Springer
14 years 5 days ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
CADE
1990
Springer
14 years 1 days ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
KI
1999
Springer
14 years 8 days ago
Computing Probabilistic Least Common Subsumers in Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
Thomas Mantay, Ralf Möller, Alissa Kaplunova
ANSS
2003
IEEE
14 years 1 months ago
Internode: Internal Node Logic Computational Model
In this work, we present a computational behavioral model for logic gates called Internode (Internal Node Logic Computational Model) that considers the functionality of the gate a...
Alejandro Millán, Manuel J. Bellido, Jorge ...
ENTCS
2007
120views more  ENTCS 2007»
13 years 8 months ago
A Framework for Interpreting Traces of Functional Logic Computations
This paper is part of a comprehensive approach to debugging for functional logic languages. The basic idea of the whole project is to trace the execution of functional logic progr...
Bernd Braßel