Sciweavers

662 search results - page 11 / 133
» Formalizing Basic First Order Model Theory
Sort
View
ARTMED
2006
80views more  ARTMED 2006»
13 years 7 months ago
A formal theory for spatial representation and reasoning in biomedical ontologies
Objective: The objective of this paper is to demonstrate how a formal spatial theory can be used as an important tool for disambiguating the spatial information embodied in biomed...
Maureen Donnelly, Thomas Bittner, Cornelius Rosse
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 8 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
CADE
1998
Springer
13 years 11 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
AML
2008
53views more  AML 2008»
13 years 7 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
FASE
2010
Springer
14 years 2 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller