Sciweavers

1532 search results - page 140 / 307
» An Algebraic Process Calculus
Sort
View
BSL
2006
81views more  BSL 2006»
15 years 4 months ago
Classifying the Provably Total Functions of PA
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
Andreas Weiermann
CORR
2000
Springer
107views Education» more  CORR 2000»
15 years 4 months ago
Computing Presuppositions by Contextual Reasoning
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
Christof Monz
CIE
2005
Springer
15 years 10 months ago
A Network Model of Analogue Computation over Metric Algebras
Abstract. We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continu...
J. V. Tucker, Jeffery I. Zucker
DBPL
1995
Springer
144views Database» more  DBPL 1995»
15 years 8 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
CADE
2008
Springer
16 years 4 months ago
Individual Reuse in Description Logic Reasoning
Abstract. Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowl...
Boris Motik, Ian Horrocks