Sciweavers

429 search results - page 85 / 86
» Theorem Proving Languages for Verification
Sort
View
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 8 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
NMR
2004
Springer
14 years 1 months ago
A probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
Miodrag Raskovic, Zoran Ognjanovic, Zoran Markovic
STACS
1993
Springer
14 years 19 days ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
JFP
2000
91views more  JFP 2000»
13 years 8 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
ANSOFT
1998
157views more  ANSOFT 1998»
13 years 8 months ago
Software Engineering Programmes are not Computer Science Programmes
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
David Lorge Parnas