Add to ORKGLocal theory extensions provide a complete and efficient way for reasoning about satisfiability of certain kinds of universally quantified formulas modulo a background theory. They are therefore useful in automated reasoning, software verification, and synthesis. In this paper, we 1) provide a sufficient condition for locality of axioms with one variable specifying functions and relations, 2) show how to obtain local axiomatizations from non-local ones in some cases, 3) show how to obtain piecewise combination of different local theory extensions
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
In this paper we show that subsumption problems in the description logics {{mathcal|EL}} and EL+ can...
Correspondence theory allows us to create sound and complete axiomatizations for modal logic on fram...
Abstract. Local theory extensions provide a complete and efficient way for reasoning about satisfiab...
Abstract. To support verification of expressive properties of functional programs, we consider algeb...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
We present a general framework which allows to identify complex theories important in verification f...
Abstract. Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories ...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, ...
We consider the following classes of quantified formulas. Fix a set of basic relations called a basi...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (S...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
In this paper we show that subsumption problems in the description logics {{mathcal|EL}} and EL+ can...
Correspondence theory allows us to create sound and complete axiomatizations for modal logic on fram...
Abstract. Local theory extensions provide a complete and efficient way for reasoning about satisfiab...
Abstract. To support verification of expressive properties of functional programs, we consider algeb...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunction...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
We present a general framework which allows to identify complex theories important in verification f...
Abstract. Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories ...
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, ...
We consider the following classes of quantified formulas. Fix a set of basic relations called a basi...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (S...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
In this paper we show that subsumption problems in the description logics {{mathcal|EL}} and EL+ can...
Correspondence theory allows us to create sound and complete axiomatizations for modal logic on fram...