论文信息 - Temporal Reasoning over Linear Discrete Time

Temporal Reasoning over Linear Discrete Time

In this work we present a new Automated Theorem Prover, called TAS-FNext, applied to temporal logic. This is part of a broader project developed by our research group GIMAC. It is an extension of works [4], [5] and [6] concerns classical logic and [9] Minimal Temporal Logic.

Inmaculada Perez de Guzmán | Manuel Enciso | Carlos Rossi

[1] Martín Abadi,et al. Nonclausal deduction in first-order temporal logic , 1990, JACM.

[2] Reiner Hähnle,et al. Improving Temporal Logic Tableaux Using Integer Constraints , 1994, ICTL.

[3] Robert Johnson. A blackboard approach to parallel temporal tableaux , 1995 .

[4] Manuel Ojeda-Aciego,et al. TAS-D++: Syntactic Trees Transformations for Automated Theorem Proving , 1994, JELIA.

[5] Manuel Ojeda-Aciego,et al. Increasing the efficiency of automated theorem proving , 1995, J. Appl. Non Class. Logics.

[6] Luis Fariñas del Cerro,et al. Modal deduction with applications in epistemic and temporal logics , 1995 .

[7] Reiner Hähnle,et al. Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[8] A. Ramsay. Formal Methods in Artificial Intelligence , 1988 .

[9] Melvin Fitting,et al. Destructive Modal Resolution , 1990, J. Log. Comput..

[10] Lincoln A. Wallen,et al. Automated proof search in non-classical logics - efficient matrix proof methods for modal and intuitionistic logics , 1990, MIT Press series in artificial intelligence.

[11] Martín Abadi,et al. Modal Theorem Proving , 1986, CADE.

[12] Michael Fisher,et al. A Resolution Method for Temporal Logic , 1991, IJCAI.