Sciweavers

4372 search results - page 127 / 875
» Algorithmic Theories of Everything
Sort
View
COSIT
1999
Springer
162views GIS» more  COSIT 1999»
14 years 1 months ago
Terminological Default Reasoning about Spatial Information: A First Step
We extend the theory about terminological default reasoning by using a logical base language that can represent spatioterminological phenomena. Based on this description logic lang...
Ralf Möller, Michael Wessel
HYBRID
1997
Springer
14 years 1 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
VLDB
1989
ACM
44views Database» more  VLDB 1989»
14 years 28 days ago
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
Weimin Du, Ahmed K. Elmagarmid
LANMR
2004
13 years 10 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...