An efficient decision procedure for the theory of rational order

DOI10.1016/0304-3975(77)90037-8zbMath0372.02024OpenAlexW2004091282WikidataQ126310990 ScholiaQ126310990MaRDI QIDQ1244341

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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• The computational complexity of logical theories
• A Decision Procedure for the First Order Theory of Real Addition with Order