Deciding Monodic Fragments by Temporal Resolution

No abstract is available for this paper.

• Publication year

  2005

• Venue

  CADE

• Publication date

  2005-07-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11532231_15
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Temporalising Tableaux

  2004cited by this paper
• TeMP: A Temporal Monodic Prover

  2004influential reference
• Handling Equality in Monodic Temporal Resolution

  2003cited by this paper
• Monodic temporal resolution

  2003cited by this paper
• Towards the implementation of first-order temporal resolution: the expanding domain case

  2003cited by this paper
• Monodic Packed Fragment with Equality is Decidable

  2002cited by this paper
• Axiomatizing the monodic fragment of first-order temporal logic

  2002cited by this paper
• Handbook of Automated Reasoning: Volume 1

  2001cited by this paper
• Splitting Through New Proposition Symbols

  2001cited by this paper
• Resolution Theorem Proving

  2001cited by this paper
• Paramodulation-Based Theorem Proving

  2001cited by this paper
• Computing Small Clause Normal Forms

  2001cited by this paper
• Splitting Without Backtracking

  2001cited by this paper
• Resolution Decision Procedures

  2001cited by this paper
• In handbook of automated reasoning

  2001cited by this paper
• Decidable fragment of first-order temporal logics

  2000cited by this paper
• Maslov's Class K Revisited

  1999influential reference
• Clausal temporal resolution

  1999cited by this paper
• A superposition decision procedure for the guarded fragment with equality

  1999influential reference
• The Classical Decision Problem

  1997cited by this paper
• Temporal and Modal Logic

  1991cited by this paper

• Resolution-based methods for linear temporal reasoning

  2015cites this paper
• Labelled Superposition for PLTL

  2012cites this paper
• Implementing a fair monodic temporal logic prover

  2010influential citation
• Proceedings of the Automated Reasoning Workshop 2009 Bridging the Gap between Theory and Practice ARW 2009 21 st – 22 nd April 2009

  2009cites this paper
• Resolution-Based Model Construction for PLTL

  2009cites this paper
• Resolution-Based Model Construction for PLTL ( Extended Version )

  2009cites this paper
• Fair Derivations in Monodic Temporal Reasoning

  2009cites this paper
• Redundancy Elimination in Monodic Temporal Reasoning

  2009cites this paper
• Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems

  2007cites this paper
• Proceedings of the 6th International Workshop on

  2007cites this paper
• Implementing Temporal Logics: Tools for Execution and Proof (Tutorial Paper)

  2005cites this paper
• Final report : ‘ Analysis and Mechanisation of Decidable First-Order Temporal Logics ’

  year unknowncites this paper
• 2 . 1 WP 1 : Tableau algorithms for monodic FOTL

  year unknowncites this paper