Results 11  20
of
37
Modal logic and the twovariable fragment
 IN ANNUAL CONF. OF THE EUROPEAN ASSOCIATION FOR COMPUTER SCIENCE LOGIC (CSL’01), LNCS
, 2001
"... We introduce a modal language L which is obtained from standard modal logic by adding the Boolean operators on accessibility relations, the identity relation, and the converse of relations. It is proved that L has the same expressive power as the twovariable fragment F O2 of firstorder logic, bu ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean operators on accessibility relations, the identity relation, and the converse of relations. It is proved that L has the same expressive power as the twovariable fragment F O2 of firstorder logic, but speaks less succinctly about relational structures: if the number of relations is bounded, then Lsatisfiability is ExpTimecomplete but F O2 satisfiability is NExpTimecomplete. We indicate that the relation between L and F O2 provides a general framework for comparing modal and temporal languages with firstorder languages.
SemiQualitative Reasoning About Distances: A Preliminary Report
, 2000
"... We introduce a family of languages intended for representing knowledge and reasoning about metric (and more general distance) spaces. While the simplest language can speak only about distances between individual objects and Boolean relations between sets, the more expressive ones are capable of capt ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
We introduce a family of languages intended for representing knowledge and reasoning about metric (and more general distance) spaces. While the simplest language can speak only about distances between individual objects and Boolean relations between sets, the more expressive ones are capable of capturing notions such as `somewhere in (or somewhere out of) the sphere of a certain radius', `everywhere in a certain ring', etc. The computational complexity of the satisfiability problem for formulas in our languages ranges from NPcompleteness to undecidability and depends on the class of distance spaces in which they are interpreted. Besides the class of all metric spaces, we consider, for example, the spaces R \Theta R and N \Theta N with their natural metrics. 1 Introduction The concept of `distance between objects' is one of the most fundamental abstractions both in science and in everyday life. Imagine for instance (only imagine) that you are going to buy a house in London. You then i...
Hilbert’s twentyfourth problem
 American Mathematical Monthly
, 2001
"... 1. INTRODUCTION. For geometers, Hilbert’s influential work on the foundations of geometry is important. For analysts, Hilbert’s theory of integral equations is just as important. But the address “Mathematische Probleme ” [37] that David Hilbert (1862– 1943) delivered at the second International Cong ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
1. INTRODUCTION. For geometers, Hilbert’s influential work on the foundations of geometry is important. For analysts, Hilbert’s theory of integral equations is just as important. But the address “Mathematische Probleme ” [37] that David Hilbert (1862– 1943) delivered at the second International Congress of Mathematicians (ICM) in Paris has tremendous importance for all mathematicians. Moreover, a substantial part of
The Complexity of ResourceBounded FirstOrder Classical Logic
 11th Symposium on Theoretical Aspects of Computer Science
, 1994
"... . We give a finer analysis of the difficulty of proof search in classical firstorder logic, other than just saying that it is undecidable. To do this, we identify several measures of difficulty of theorems, which we use as resource bounds to prune infinite proof search trees. In classical firstord ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
. We give a finer analysis of the difficulty of proof search in classical firstorder logic, other than just saying that it is undecidable. To do this, we identify several measures of difficulty of theorems, which we use as resource bounds to prune infinite proof search trees. In classical firstorder logic without interpreted symbols, we prove that for all these measures, the search for a proof of bounded difficulty (i.e, for a simple proof) is \Sigma p 2 complete. We also show that the same problem when the initial formula is a set of Horn clauses is only NPcomplete, and examine the case of firstorder logic modulo an equational theory. These results allow us not only to give estimations of the inherent difficulty of automated theorem proving problems, but to gain some insight into the computational relevance of several automated theorem proving methods. Topics: computational complexity, logics, computational issues in AI (automated theorem proving). 1 Introduction Firstorder ...
Some Undecidable Problems Related to the Herbrand Theorem
, 1997
"... We improve upon a number of recent undecidability results related to the socalled Herbrand Skeleton Problem, the Simultaneous Rigid EUnification Problem and the prenex fragment of intuitionistic logic with equality. Partially supported by grants from NSF, ONR and the Faculty of Science and Techn ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
We improve upon a number of recent undecidability results related to the socalled Herbrand Skeleton Problem, the Simultaneous Rigid EUnification Problem and the prenex fragment of intuitionistic logic with equality. Partially supported by grants from NSF, ONR and the Faculty of Science and Technology of Uppsala University. 1 Introduction We study classical firstorder logic with equality but without any other relation symbols. The letters ' and / are reserved for quantifierfree formulas. The signature of a syntactic object S (a term, a set of terms, a formula, etc.) is the collection of function symbols in S augmented, in the case when S contains no constants, with a constant c. The language of S is the language of the signature of S. Any syntactic object is ground if it contains no variables. A substitution is ground if its range is ground, and it is said to be in a given language if the terms in its range are in that language. A set of substitutions is ground if each membe...
Undecidability of firstorder intuitionistic and modal logics with two variables
 Bulletin of Symbolic Logic
, 2005
"... Abstract. We prove that the twovariable fragment of firstorder intuitionistic logic is undecidable, even without constants and equality. We also show that the twovariable fragment of a quantified modal logic L with expanding firstorder domains is undecidable whenever there is a Kripke frame for L ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. We prove that the twovariable fragment of firstorder intuitionistic logic is undecidable, even without constants and equality. We also show that the twovariable fragment of a quantified modal logic L with expanding firstorder domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the firstorder extensions of practically all standard modal logics like K, K4, GL, S4, S5, K4.1, S4.2, GL.3, etc.). For many quantified modal logics, including those in the standard nomenclature above, even the monadic twovariable fragments turn out to be undecidable. §1. Introduction. Ever since the undecidability of firstorder classical logic became known [5], there has been a continuing interest in establishing the ‘borderline ’ between its decidable and undecidable fragments; see [2] for a detailed exposition. One approach to this classification problem is to consider fragments with finitely many individual variables. The
Deciding monodic fragments by temporal resolution
 In Proc. CADE20
, 2005
"... Abstract. In this paper we study the decidability of various fragments of monodic firstorder temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic temporal resolution and finegrained temporal resolution. For the first, we state a very general decidability result ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. In this paper we study the decidability of various fragments of monodic firstorder temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic temporal resolution and finegrained temporal resolution. For the first, we state a very general decidability result, which is independent of the particular decision procedure used to decide the firstorder part of the logic. For the second, we introduce refinements using orderings and selection functions. This allows us to transfer existing results on decidability by resolution for firstorder fragments to monodic firstorder temporal logic and obtain new decision procedures. The latter is of immediate practical value, due to the availability of TeMP, an implementation of finegrained temporal resolution. 1
Efficient FirstOrder Temporal Logic for InfiniteState Systems
, 2007
"... In this paper we consider the specification and verification of infinitestate systems using temporal logic. In particular, we describe parameterised systems using a new variety of firstorder temporal logic that is both powerful enough for this form of specification and tractable enough for practic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we consider the specification and verification of infinitestate systems using temporal logic. In particular, we describe parameterised systems using a new variety of firstorder temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex properties such as liveness and fairness properties. These aspects appear difficult for many other approaches to infinitestate verification. 1
Practical firstorder temporal reasoning
 Proceedings of 15th International Symposium on Temporal Representation and Reasoning (TIME), IEEE
, 2008
"... In this paper we consider the specification and verification of infinitestate systems using temporal logic. In particular, we describe parameterised systems using a new variety of firstorder temporal logic that is both powerful enough for this form of specification and tractable enough for practic ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we consider the specification and verification of infinitestate systems using temporal logic. In particular, we describe parameterised systems using a new variety of firstorder temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex liveness and fairness properties. These aspects appear difficult for many other approaches to infinitestate verification. 1.