Theorem Proving with Analytic Tableaux and Related Methods
Springer Berlin (Verlag)
978-3-540-61208-7 (ISBN)
The 18 full revised papers included together with two invited papers present state-of-the-art results in this dynamic area of research. Besides more traditional aspects of tableaux reasoning, the collection also contains several papers dealing with other approaches to automated reasoning. The spectrum of logics dealt with covers several nonclassical logics, including modal, intuitionistic, many-valued, temporal and linear logic.
On sets, types, fixed points, and checkerboards.- Fibred tableaux for multi-implication logics.- Interpolation for a sequent calculus of generalized quantifiers.- Almost duplication-free tableau calculi for prepositional lax logics.- Combining many-valued and intuitionistic tableaux.- Cyclic connections.- Incremental theory reasoning methods for semantic tableaux.- The disconnection method.- Sequent calculi for default and autoepistemic logics.- Minimal model generation with positive unit hyper-resolution tableaux.- Distributed modal theorem proving with KE.- A simple tableau system for the logic of elsewhere.- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison.- Efficient loop-check for backward proof search in some non-classical propositional logics.- Strong normalization for all-style LKtq.- T-string unification: Unifying prefixes in non-classical proof methods.- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits.- A tableau calculus for minimal model reasoning.- On the intuitionistic force of classical search (Extended abstract).- Proof-search in intuitionistic logic based on constraint satisfaction.
| Erscheint lt. Verlag | 24.4.1996 |
|---|---|
| Reihe/Serie | Lecture Notes in Artificial Intelligence | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 336 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 490 g |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| Schlagworte | automated deduction • automated reasoning • Automatisches Beweisverfahren • Automatisierte Deduktion • Calculus • Constraint Satisfaction • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Mathematische Logik • Nicht-klassische Logiken • Nonclassical Logics • Proof • proving • sequent calculus • Sets • Tableaukalkül • Tableaux Calculus • Tableaux Resonning • Tableaux-Schliessen • Theorem-Beweise • theorem proving |
| ISBN-10 | 3-540-61208-4 / 3540612084 |
| ISBN-13 | 978-3-540-61208-7 / 9783540612087 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
