Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,099
A Decidable Fragment of Separation Logic
- In FSTTCS
, 2004
"... We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the stylized form of reasoning done in example program proofs. The fragment includes a predicate for describing linked list ..."
Abstract
-
Cited by 95 (7 self)
- Add to MetaCart
list segments (a kind of reachability or transitive closure). Decidability is first proved by semantic means: by showing a small model property that bounds the size of potential countermodels that must be checked. We then provide a complete proof system for the fragment, the termination of which
Tractable and Decidable Fragments of Conceptual Graphs
- IN PROCEEDINGS OF ICCS'99
, 1999
"... It is well-known that problems like validity and subsumption of general CGs are undecidable, whereas subsumption is NP-complete for simple conceptual graphs (SGs) and tractable for SGs that are trees. We will employ results on decidable fragments of rst-order logic to identify a natural and expressi ..."
Abstract
-
Cited by 18 (0 self)
- Add to MetaCart
It is well-known that problems like validity and subsumption of general CGs are undecidable, whereas subsumption is NP-complete for simple conceptual graphs (SGs) and tractable for SGs that are trees. We will employ results on decidable fragments of rst-order logic to identify a natural
Decidable Fragments of Many-Sorted Logic
- LPAR 2007
, 2007
"... We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of many-sorted (typed) first- order logic. The motivation is that types simplify the complexity of mixed quantifiers when th ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
they quantify over different types. We noticed that many real world verification problems can be formalized by quantifying over different types in such a way that the relations between types remain simple. Our main result is a decidable fragment of many-sorted first-order logic that captures many real world
Monitoring for a decidable fragment of MTLD Monitoring for a decidable fragment of MTLD Monitoring for a decidable fragment of MTL
"... Abstract Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTLD, we propose a new approach for the runtime verification of hard real-time systems. The novelty of our technique is that it is based on incremental evaluation, allowing us to ef ..."
Abstract
- Add to MetaCart
the applicability of this mechanism as well as the validity of the provided complexity results. Monitoring for a decidable fragment of MTL- Abstract. Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTL-, we propose a new approach for the runtime
A decidable fragment of predicate calculus
- Theoretical Computer Science
, 1984
"... FIRST-ORDER predicate logic has been traditionally viewed as the place to formalize the mathematician's notion of a "tautologous inference"; intuitively it is clear that any trivial inference should be easily formalizable and decidable in predicate logic. While one could take issue wi ..."
Abstract
-
Cited by 30 (0 self)
- Add to MetaCart
with the question of the ease of formalization U. Ketonen, 1981), I shall concentrate now on the question of decidability. 1. THE ISSUE OF DECIDABILITY As is well known, the full system of predicate calculus is not decidable; thus one must study suitable fragments of predicate logic. For the most trivial case
Decidable Fragments of First-Order Temporal Logics
, 1999
"... In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time ..."
Abstract
-
Cited by 96 (27 self)
- Add to MetaCart
structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal logics and of two-sorted first-order logics in which one sort is intended for temporal reasoning
Decidable Fragments of Simultaneous Rigid Reachability
, 1999
"... In this paper we prove decidability results of restricted fragments of simultaneous rigid reachability or SRR, that is the nonsymmetrical form of simultaneous rigid E-unification or SREU. The absence of symmetry enforces us to use different methods, than the ones that have been successful in the con ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
In this paper we prove decidability results of restricted fragments of simultaneous rigid reachability or SRR, that is the nonsymmetrical form of simultaneous rigid E-unification or SREU. The absence of symmetry enforces us to use different methods, than the ones that have been successful
Decidable Fragments of First-Order Modal Logics
- JOURNAL OF SYMBOLIC LOGIC
, 1999
"... The paper considers the set ML1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML1, which reduces the modal satisfiability to the classica ..."
Abstract
-
Cited by 30 (8 self)
- Add to MetaCart
to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.
Results 1 - 10
of
1,099
