|
|
|
|
LEADER |
03908nam a22005295i 4500 |
001 |
978-3-540-31822-4 |
003 |
DE-He213 |
005 |
20151123194710.0 |
007 |
cr nn 008mamaa |
008 |
100316s2005 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540318224
|9 978-3-540-31822-4
|
024 |
7 |
|
|a 10.1007/11554554
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TJ210.2-211.495
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TJFM1
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Automated Reasoning with Analytic Tableaux and Related Methods
|h [electronic resource] :
|b 14th International Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005. Proceedings /
|c edited by Bernhard Beckert.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
300 |
|
|
|a XIV, 346 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3702
|
505 |
0 |
|
|a Invited Talks -- Query Processing in Peer-to-Peer Systems: An Epistemic Logic Approach -- Description Logics in Ontology Applications -- Automated Reasoning in the Context of the Semantic Web -- Formal Versus Rigorous Mathematics: How to Get Your Papers Published -- Research Papers -- Consistency of Variable Splitting in Free Variable Systems of First-Order Logic -- On the Dynamic Increase of Multiplicities in Matrix Proof Methods for Classical Higher-Order Logic -- A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic -- Cyclic Proofs for First-Order Logic with Inductive Definitions -- A Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity -- Embedding Static Analysis into Tableaux and Sequent Based Frameworks -- A Calculus for Type Predicates and Type Coercion -- A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics -- Comparing Instance Generation Methods for Automated Reasoning -- An Order-Sorted Quantified Modal Logic for Meta-ontology -- A Redundancy Analysis of Sequent Proofs -- A Tableau Algorithm for Description Logics with Concrete Domains and GCIs -- The Space Efficiency of OSHL -- Efficient Query Processing with Compiled Knowledge Bases -- Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic -- Automatic ‘Descente Infinie’ Induction Reasoning -- A Decision Procedure for the Alternation-Free Two-Way Modal ?-Calculus -- On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency -- System Descriptions -- Pdk: The System and Its Language -- Proof Output and Transformation for Disconnection Tableaux -- LoTREC: Logical Tableaux Research Engineering Companion -- A Tableau-Based Explainer for DL Subsumption -- CondLean 3.0: Improving CondLean for Stronger Conditional Logics -- The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic -- Unit Propagation in a Tableau Framework.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Beckert, Bernhard.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540289319
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3702
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11554554
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|