Sciweavers

162 search results - page 13 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CAV
2007
Springer
118views Hardware» more  CAV 2007»
15 years 4 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi
LOPSTR
2007
Springer
15 years 4 months ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...
ECAI
2010
Springer
14 years 11 months ago
Using Bayesian Networks in an Industrial Setting: Making Printing Systems Adaptive
Abstract. Control engineering is a field of major industrial importance as it offers principles for engineering controllable physical devices, such as cell phones, television sets,...
Arjen Hommersom, Peter J. F. Lucas
ECAI
1992
Springer
15 years 1 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe