Fabio Massacci. Simplification: a general constraint propagation technique for propositional and modal tableaux. In Proceedings of Tableaux'98. Lect. Notes in Artificial Intelligence, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Satisfiability testing for Boolean formulas using.. - Gutiérrez, de.. (Correct)
....the first variable occurring in A. As our method is specially focused on non cnf formulas we have run the prover, named TAS, on the IFIP benchmarks for hardware verification [3] The results obtained, using a Power Macintosh G3 with 64 Mb of memory and 233 Mhz, are compared with those obtained in [6], for he also uses there a reduction like strategy (which he calls simplification) in his experiments he used a Sun SuperSPARK. In Table I, we compare our implementation with the results obtained by Isabelle [8] a well known interactive prover, written in Standard ML) and Beatrix (a sicstus ....
Fabio Massacci. Simplification: a general constraint propagation technique for propositional and modal tableaux. In Proceedings of Tableaux'98. Lect. Notes in Artificial Intelligence, 1998.
A First-order Simplification Rule with Constraints - Giese (2000) (Correct)
....Another case is the integration of automated and interactive theorem proving [1,8] where normal forms would be counter intuitive. Unfortunately, standard non normal form tableaux tend to be rather ine#cient, as many of the refinements available to clausal procedures are hard to adapt. In [11], Massacci presents a simplification rule for propositional and modal tableau calculi. This rule is of the form # # simp # #[#] # where #[#] is the formula that results form first replacing any occurrence of # in # by true, 1 and then applying a set of boolean simplifications of the form ....
....is solved in 85 seconds. The ones not solved are mainly from the GRP and LCL categories. To our knowledge, comparable results have not previously been achieved with a non clausal tableaux prover. 5 Conclusion Several possibilities for a first order version of the simplification rule of Massacci [10,11] were presented. Instead of globally applying unifying substitutions, syntactic constraints are used. Besides soundness and completeness, a finiteness property is discussed, which is important for the design of fair proof procedures. Experimental results are quoted, which show that an e#cient ....
Fabio Massacci. Simplification: A general constraint propagation technique for propositional and modal tableaux. In Harrie de Swart, editor, Proc. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Oosterwijk, The Netherlands, volume 1397 of LNCS, pages 217--232. Springer-Verlag, 1998.
A Constraint-Based Validity Solver for Intuitionistic.. - Huth (Correct)
....same data structure, a constraintflow model for OE. We formulate an invariant for this analysis to prove soundness of the deductive system and the resulting static analysis. A full paper will discuss related work in more detail and sketch why our techniques may be applied to general modal logics [2, 3]. Keywords validity checker, intuitionistic propositional logic, resolution, constraint propagation, flow analysis, looping, model checking modal logics. 1 Introduction Deciding the validity of formulas in intuitionistic propositional logic is a PSPACE complete problem [7] Any non valid ....
F. Massacci. Simplification: A General Constraint Propagation Technique for Propositional and Modal Tableaux. In H. de Swart, editor, Proceedings of TABLEAUX'98, volume 1397 of Lecture Notes in Computer Science, pages 217--231. Springer Verlag, 1998. Oisterwijk, The Netherlands.
KtSeqC: System Description - Boyapati, Goré (1999) (2 citations) (Correct)
....sided labelled sequent system for tense logic Kt described in [BG98] which itself is based upon the work of [BP95, Mas94, HSZ96] The work of Pitt [PC96] is closely related but Pitt uses the calculus KE incorporating an analytical cut rule. We have also incorporated simplification as reported in [Mas98, HS98]. The system converts a given formula to implication free negated normal form and performs some optimisations that handle the commutativity of the binary connectives. The search strategy picks a formula on the right hand side of the sequent and then applies the inference rule appropriate to the ....
F. Massacci. Simplification: a general constraint propagation technique for propositional and modal tableaux. In Tableaux98, LNAI 1397:187-201. Springer, 1998.
A Labelled Sequent System for Tense Logic K t - Bonnette, Goré (1998) (4 citations) (Correct)
....argument indexing as utilised by leanTAP [BP95] It is important then that the benefits are greater than the sacrifices and further work will be directed towards such optimizations as are possible. One strategy that may improve the efficacy of our system is to include some form of simplification [Mas98]. Our axioms allow closure only on literals; closure on compound complementary formulae is another area in which optimisation is possible. We would also like to investigate the use of variables and unification in labelling [Gov95, PC96] ....
F Massacci. Simplification: a general constraint propagation technique for propositional and modal tableaux. In Proc. TABLEAUX-98, LNCS ?, to appear. Springer, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC