Results 1 
3 of
3
Modelbased threedimensional interpretations of twodimensional images
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1983
"... ACRONYM IS a comprehensive domain independent modelbased system for vision and manipulation related tasks. Many of its submodules and representations have been described elsewhere. Here the derivation and use of invariants for image feature prediction is described. We describe how predictions of im ..."
Abstract

Cited by 92 (0 self)
 Add to MetaCart
ACRONYM IS a comprehensive domain independent modelbased system for vision and manipulation related tasks. Many of its submodules and representations have been described elsewhere. Here the derivation and use of invariants for image feature prediction is described. We describe how predictions of image features and their relations are made and how instructions are generated which tell the interpretation algorithms how to make use of image feature measurments to derive three dimensional sizes and structural and spatial constraints on the original threedimensional models. Some preliminary examples of ACRONYM'S interpretations of aerial images are shown. 1
A survey of automated deduction
 EDINBURGH ARTI INTELLIGENCE RESEARCH PAPER 950
, 1999
"... We survey research in the automation of deductive inference, from its beginnings in the early history of computing to the present day. We identify and describe the major areas of research interest and their applications. The area is characterised by its wide variety of proof methods, forms of autom ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We survey research in the automation of deductive inference, from its beginnings in the early history of computing to the present day. We identify and describe the major areas of research interest and their applications. The area is characterised by its wide variety of proof methods, forms of automated deduction and applications.
Static Analysis of CLP Programs over Numeric Domains
 IN ACTES WORKSHOP ON STATIC ANALYSIS '92
, 1992
"... Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar modeltheoretic, fixpoint and operational semantics [9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP ha ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar modeltheoretic, fixpoint and operational semantics [9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be instantiated on various semantic domains, thus achieving a good expressive power. One relevant feature is the distinction between testing for solvability and computing a solution of a given constraint formula. In the logic programming case, this corresponds to the unification process, which tests for solvability by computing a solution (a set of equations in solved form or most general unifier ). In CLP, the computation of a solution of a constraint is left to a constraint solver, which does not affect the semantic definition of the language. This allows different computational domains, e.g. real arithmetic, to...