|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3195483 |
| 003 |
MWH |
| 005 |
20191026032908.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2001 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540457442
|
| 024 |
7 |
|
|a 10.1007/3-540-45744-5
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-45744-2
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQ
|2 thema
|
| 245 |
1 |
0 |
|a Automated Reasoning
|h [electronic resource] :
|b First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings /
|c edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow.
|
| 250 |
|
|
|a 1st ed. 2001.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
| 300 |
|
|
|a XIII, 712 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 Artificial Intelligence ;
|v 2083
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a Invited Talks -- Program Termination Analysis by Size-Change Graphs (Abstract) -- SET Cardholder Registration: The Secrecy Proofs -- SET Cardholder Registration: The Secrecy Proofs -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Description, Modal and temporal Logics -- The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach -- NExpTime-Complete Description Logics with Concrete Domains -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- The Hybrid ?-Calculus -- The Hybrid ?-Calculus -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Tableaux for Temporal Description Logic with Constant Domains -- Tableaux for Temporal Description Logic with Constant Domains -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Saturation Based Theorem Proving, Applications, and Data Structures -- Instructing Equational Set-Reasoning with Otter -- NP-Completeness of Refutability by Literal-Once Resolution -- Ordered Resolution vs. Connection Graph resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Context Trees -- Context Trees -- On the Evaluation of Indexing Techniques for Theorem Proving -- On the Evaluation of Indexing Techniques for Theorem Proving -- Logic Programming and Nonmonotonic Reasoning -- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation -- Bunched Logic Programming -- A Top-Down Procedure for Disjunctive Well-Founded Semantics -- A Second-Order Theorem Prover Applied to Circumscription -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- Propositional Satisfiability and Quantified Boolean Logic -- Conditional Pure Literal Graphs -- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability -- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability -- System Abstract: E 0.61 -- Vampire 1.1 -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving -- More On Implicit Syntax -- Termination and Reduction Checking for Higher-Order Logic Programs -- P.rex: An Interactive Proof Explainer -- JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants -- Semantic Guidance -- The eXtended Least Number Heuristic -- System Description: SCOTT-5 -- Combination of Distributed Search and Multi-Search in Peers-mcd.d -- Lotrec: The Generic Tableau Prover for Modal and Description Logics -- The modprof Theorem Prover -- A New System and Methodology for Generating Random Modal Formulae -- Equational Theorem Proving and Term Rewriting -- Decidable Classes of Inductive Theorems -- Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems -- Decidability and Complexity of Finitely Closable Linear Equational Theories -- A New Meta-Complexity Theorem for Bottom-Up Logic Programs -- Tableau, Sequent, Natural Deduction Calculi and Proof Theory -- Canonical Propositional Gentzen-Type Systems -- Incremental Closure of Free Variable Tableaux -- Deriving Modular Programs from Short Proofs -- A General Method for Using Schematizations in Automated Deduction -- Automata, Specification, Verification, and Logics of Programs -- Approximating Dependency Graphs Using Tree Automata Techniques -- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables -- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities -- Flaw Detection in Formal Specifications -- CCE: Testing Ground Joinability -- System Description: RDL Rewrite and Decision Procedure Laboratory -- lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic -- Nonclassical Logics -- Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction -- Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory -- STRIP: Structural Sharing for Efficient Proof-Search -- RACER System Description.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Software engineering.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Gore, Rajeev.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Leitsch, Alexander.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Nipkow, Tobias.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 2083
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-45744-5
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b31954832
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21086461
|z 02-26-20
|
| 999 |
f |
f |
|i fd963325-3a6c-5016-a065-c779dbbf2c56
|s 55ad8312-bd5d-54a9-96ac-2e3f820fe9e9
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|