An efficient decision procedure for the theory of rational order

DOI10.1016/0304-3975(77)90037-8MaRDI QIDQ1244341zbMATH OpenOpenAlexWikidataFDO

Authors Jeanne Ferrante, James R. Geiser

Publication date 1977

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(77)90037-8

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Decidability (number-theoretic aspects) (11U05) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Decision Procedure for the First Order Theory of Real Addition with Order
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• The computational complexity of logical theories

Cited in

(3)

• The complexity of query evaluation in indefinite temporal constraint databases
• Symbolic model checking of timed guarded commands using difference decision diagrams
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints

This page was built for publication: An efficient decision procedure for the theory of rational order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244341)