Executable Modal and Temporal Logics: IJCAI '93 Workshop, Chambery, France, August 28, 1993. Proceedings: 897 (Lecture Notes in Computer Science, 897) - Livres de poche

EAN (ISBN-13): 9783540613770
ISBN (ISBN-10): 3540613773
Version reliée
Livre de poche
Date de parution: 1996
Editeur: Springer Berlin Heidelberg
487 Pages
Poids: 0,754 kg

Livre dans la base de données depuis 2007-05-29T12:49:59+02:00 (Zurich)
Page de détail modifiée en dernier sur 2023-12-26T15:55:05+01:00 (Zurich)
ISBN/EAN: 3540613773

ISBN - Autres types d'écriture:
3-540-61377-3, 978-3-540-61377-0
Autres types d'écriture et termes associés:
Auteur du livre: buning, klein hans, kleine büning, fisher, richard owen
Titre du livre: selected papers, annual, csi, michaels kloster paderborn, international conference computer science, riphahn, modal logic, germany, workshop

---

Données de l'éditeur

Auteur: Hans Kleine Buening
Titre: Lecture Notes in Computer Science; Computer Science Logic - 9th International Workshop, CSl '95, Annual Conference of the EACSL Paderborn, Germany, September 22-29, 1995. Selected Papers
Editeur: Springer; Springer Berlin
492 Pages
Date de parution: 1996-06-05
Berlin; Heidelberg; DE
Imprimé / Fabriqué en
Poids: 1,540 kg
Langue: Anglais
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
VIII, 492 p.

BC; Theory of Computation; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; computer; formal language; logic; proof theory; proving; selection; theorem proving; Programming Languages, Compilers, Interpreters; Computer System Implementation; Mathematical Logic and Formal Languages; Artificial Intelligence; Logics and Meanings of Programs; Theory of Computation; Compilers and Interpreters; Computer System Implementation; Formal Languages and Automata Theory; Artificial Intelligence; Computer Science Logic and Foundations of Programming; Compiler und Übersetzer; Systemanalyse und -design; Künstliche Intelligenz; EA

Incompleteness of a first-order gödel logic and some temporal logics of programs.- Semantics of non-terminating rewrite systems using minimal coverings.- Congruence Types.- Deduction by combining semantic tableaux and integer programming.- leanEA: A lean evolving algebra compiler.- A proof system for finite trees.- Representing unification in a logical framework.- Decision procedures using model building techniques.- A note on the relation between polynomial time functionals and Constable's class K.- First order logic, fixed point logic and linear order.- Simultaneous rigid E-unification is undecidable.- An evolving algebra abstract machine.- Rewriting with extensional polymorphic ?-calculus.- Languages and logical definability in concurrency monoids.- Generalized implicit definitions on finite structures.- The railroad crossing problem: An experiment with instantaneous actions and immediate reactions.- A logical aspect of parametric polymorphism.- On the modal logic K plus theories.- Improved decision procedures for the modal logics K, T and S4.- A fully abstract denotational model for observational precongruence.- On sharply bounded length induction.- Effective strategies for enumeration games.- Bounded fixed-point definability and tabular recognition of languages.- Equivalences among various logical frameworks of partial algebras.- Some extensions to propositional mean-value calculus: Expressiveness and decidability.- Theorem proving modulo associativity.- Positive deduction modulo regular theories.