Automated deduction in classical and non-classical logics : selected papers
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science. Lecture notes in artificial intelligence
1761 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automated deduction in classical and non-classical logics, selected papers, Ricardo Caferra, Gernot Salzer (eds.), 2000, New York, Springer, 1 vol. (VIII-297 p.), Lecture notes in computer science, 3-540-67190-0 • Automated Deduction in Classical and Non-Classical Logics, Texte imprimé, 9783662163160 |
Indholdsfortegnelse:
- Invited Papers
- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory
- Higher-Order Modal Logic A Sketch
- Proving Associative-Commutative Termination Using RPO-Compatible Orderings
- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction
- Replacement Rules with Definition Detection
- Contributed Papers
- On the Complexity of Finite Sorted Algebras
- A Further and Effective Liberalization of the ?-Rule in Free Variable Semantic Tableaux
- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory
- Interpretation of a Mizar-Like Logic in First Order Logic
- An ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic
- Implicational Completeness of Signed Resolution
- An Equational Re-engineering of Set Theories
- Issues of Decidability for Description Logics in the Framework of Resolution
- Extending DecidableClause Classes via Constraints
- Completeness and Redundancy in Constrained Clause Logic
- Effective Properties of Some First Order Intuitionistic Modal Logics
- Hidden Congruent Deduction
- Resolution-Based Theorem Proving for SH n-Logics
- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized ?-Rule but Without Skolemization.