06345nam 22005535 450 99646594000331620200630174056.03-540-39861-910.1007/3-540-16780-3(CKB)1000000000230543(SSID)ssj0000320753(PQKBManifestationID)11264086(PQKBTitleCode)TC0000320753(PQKBWorkID)10259111(PQKB)11582402(DE-He213)978-3-540-39861-5(PPN)155210688(EXLCZ)99100000000023054320121227d1986 u| 0engurnn|008mamaatxtccr8th International Conference on Automated Deduction[electronic resource] Oxford, England, July 27- August 1, 1986. Proceedings /edited by Jörg H. Siekmann1st ed. 1986.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1986.1 online resource (XII, 716 p.) Lecture Notes in Computer Science,0302-9743 ;230Bibliographic Level Mode of Issuance: Monograph3-540-16780-3 Connections and higher-order logic -- Commutation, transformation, and termination -- Full-commutation and fair-termination in equational (and combined) term-rewriting systems -- An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations -- Proving termination of associative commutative rewriting systems by rewriting -- Relating resolution and algebraic completion for Horn logic -- A simple non-termination test for the Knuth-Bendix method -- A new formula for the execution of categorical combinators -- Proof by induction using test sets -- How to prove equivalence of term rewriting systems without induction -- Sufficient completeness, term rewriting systems and ”anti-unification” -- A new method for establishing refutational completeness in theorem proving -- A theory of diagnosis from first principles -- Some contributions to the logical analysis of circumscription -- Modal theorem proving -- Computational aspects of three-valued logic -- Resolution and quantified epistemic logics -- A commonsense theory of nonmonotonic reasoning -- Negative paramodulation -- The heuristics and experimental results of a new hyperparamodulation: HL-resolution -- ECR: An equality conditional resolution proof procedure -- Using narrowing to do isolation in symbolic equation solving — an experiment in automated reasoning -- Formulation of induction formulas in verification of prolog programs -- Program verifier "Tatzelwurm": Reasoning about systems systems of linear inequalities -- An interactive verification system based on dynamic logic -- What you always wanted to know about clause graph resolution -- Parallel theorem proving with connection graphs -- Theory links in semantic graphs -- Abstraction using generalization functions -- An improvement of deduction plans: Refutation plans -- Controlling deduction with proof condensation and heuristics -- Nested resolution -- Mechanizing constructive proofs -- Implementing number theory: An experiment with Nuprl -- Parallel algorithms for term matching -- Unification in combinations of collapse-free theories with disjoint sets of function symbols -- Combination of unification algorithms -- Unification in the data structure sets -- NP-completeness of the set unification and matching problems -- Matching with distributivity -- Unification in boolean rings -- Some relationships between unification, restricted unification, and matching -- A classification of many-sorted unification problems -- Unification in many-sorted equational theories -- Classes of first order formulas under various satisfiability definitions -- Diamond formulas in the dynamic logic of recursively enumerable programs -- A prolog machine -- A prolog technology theorem prover: Implementation by an extended prolog compiler -- Paths to high-performance automated theorem proving -- Purely functional implementation of a logic -- Causes for events: Their computation and applications -- How to clear a block: Plan formation in situational logic -- Deductive synthesis of sorting programs -- The TPS theorem proving system -- Trspec: A term rewriting based system for algebraic specifications -- Highly parallel inference machine -- Automatic theorem proving in the ISDV system -- The karlsruhe induction theorem proving system -- Overview of a theorem-prover for a computational logic -- GEO-prover — A geometry theorem prover developed at UT -- The markgraf karl refutation procedure (MKRP) -- The J-machine: Functional programming with combinators -- The illinois prover: A general purpose resolution theorem prover -- Theorem proving systems of the Formel project -- The passau RAP system: Prototyping algebraic specifications using conditional narrowing -- RRL: A rewrite rule laboratory -- A geometry theorem prover based on Buchberger's algorithm -- REVE a rewrite rule laboratory -- ITP at argonne national laboratory -- Autologic at university of victoria -- Thinker -- The KLAUS automated deduction system -- The KRIPKE automated theorem proving system -- SHD-prover at university of texas at austin.Lecture Notes in Computer Science,0302-9743 ;230Mathematical logicArtificial intelligenceMathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical logic.Artificial intelligence.Mathematical Logic and Foundations.Mathematical Logic and Formal Languages.Artificial Intelligence.511.3Siekmann Jörg Hedthttp://id.loc.gov/vocabulary/relators/edtBOOK9964659400033168th International Conference on Automated Deduction2831112UNISA01293nam a2200289 i 4500991000131949707536090318s2008 it b 001 0 ita d9788861373426b13817954-39ule_instDip.to Scienze pedagogicheita371.90474Scataglini, Carlo476625Fare sostegno nelle scuole superiori :dagli aspetti teorico-metodologici alla dimensione operativa /Carlo Scataglini, Sofia Cramerotti e Dario Ianes ; appendice normativa di Salvatore NoceraTrento :Erickson,2008468 p. :ill. ;24 cmGuide per l'educazione specialeCon bibliografia (p. 457-466) e indicePedagogia specialeScuola superioreCramerotti, Sofiaauthorhttp://id.loc.gov/vocabulary/relators/aut568218Ianes, DarioNocera, Salvatore.b1381795404-05-0918-03-09991000131949707536LE022 371 SCA02.0112022000128544le022LE022/MONOGRAFIE/2009LE022/PINNELLI/2009pE19.50-l- 0208200.i1496252404-05-09Fare sostegno nelle scuole superiori1465148UNISALENTOle02218-03-09ma -itait 00