Linear arithmetic extended with free predicate symbols is undecidable, in general. We show that the restriction of linear arithmetic inequations to simple bounds extended with the Bernays-Sch\"onfinkel-Ramsey free first-order fragment is decidable and NEXPTIME-complete. The result is almost tight because the Bernays-Sch\"onfinkel-Ramsey fragment is undecidable in combination with linear difference inequations, simple additive inequations, quotient inequations and multiplicative inequations
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
A well-known result in Reverse Mathematics is the equivalence of the formalized version of the Gödel...
Linear arithmetic extended with free predicate symbols is undecidable, in general. We show that the ...
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We s...
International audienceIn general, first-order predicate logic extended with linear integer arithmeti...
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesti...
International audienceFirst-order linear real arithmetic enriched with uninterpreted predicate symbo...
International audienceThis paper investigates the satisfiability problem for Separation Logic with k...
International audienceSeparation Logic (SL) is a well-known assertion language used in Hoare-style m...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
International audienceFirst-order linear rational arithmetic enriched with uninterpreted predicates ...
The first-order theory of addition over the natural numbers, known as Presburger arithmetic , is dec...
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality ...
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality ...
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
A well-known result in Reverse Mathematics is the equivalence of the formalized version of the Gödel...
Linear arithmetic extended with free predicate symbols is undecidable, in general. We show that the ...
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We s...
International audienceIn general, first-order predicate logic extended with linear integer arithmeti...
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesti...
International audienceFirst-order linear real arithmetic enriched with uninterpreted predicate symbo...
International audienceThis paper investigates the satisfiability problem for Separation Logic with k...
International audienceSeparation Logic (SL) is a well-known assertion language used in Hoare-style m...
First-order logic is one of the most prominent formalisms in computer science and mathematics. Since...
International audienceFirst-order linear rational arithmetic enriched with uninterpreted predicates ...
The first-order theory of addition over the natural numbers, known as Presburger arithmetic , is dec...
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality ...
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality ...
URL : http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-259/paper06.pdfInternational...
We introduce a new decidable fragment of first-order logic with equality, which strictly generalizes...
A well-known result in Reverse Mathematics is the equivalence of the formalized version of the Gödel...
Add to ORKG