LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Publisher: IJCAR
Languages: English
Types: Unknown
Subjects: UOWSAT

Classified by OpenAIRE into

ACM Ref: TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
arxiv: Computer Science::Logic in Computer Science
This paper presents a calculus of Socratic proofs for Propositional Linear-Time Logic (PLTL) and discusses potential automation of its proof search.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] O. Grigoryev A. Basukoski, A. Bolotov and V. Shangin. Natural deduction system for linear time temporal logic . Logical investigations, (13):71-95, 2004.
    • [2] A. Avron. The Method of Hypersequents in the Proof Theory of Propositional Non-Classical Logics, pages 1-32. Logic: Foundations to Applications. Clarendon Press, 1996.
    • [3] M. Finger, D. M. Gabbay, and M. Reynolds. Advanced Tense Logic, volume 7 of Handbook of Philosophical Logic, pages 43-203. Springer, 2002.
    • [4] Michael Fisher, Clare Dixon, and Martin Peim. Clausal temporal resolution. ACM Trans. Comput. Log., 2(1):12-56, 2001.
    • [5] D. M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In 7th ACM Symposium on Principles of Programming Languages, pages 163-173, 1980.
    • [6] A. Pnueli. The temporal logic of programs. In Proceedings of the 18th Symposium on Foundations of Computer Science, pages 46-57, 1977.
    • [7] A. P. Sistla and E. M. Clarke. The complexity of Propositional Linear Temporal Logic. Journal of the Association for Computing Machinery, 32(3):733- 749, 1985.
    • [8] A. Wis´niewski. Socratic Proofs. Journal of Philosophical Logic, 33(2):299-326, 2004.
    • [9] A. Wis´niewski and V. Shangin. Socratic proofs for quantifiers. Journal of Philosophical Logic, 35(2):147-178, 2006.
    • [10] A. Wis´niewski, G. Vanackere, and D. Leszczyn´ska. Socratic Proofs and Paraconsistency. A Case Study. Studia Logica, 80:431-466, 2005.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article