000 06144nam a22006375i 4500
001 978-3-319-94205-6
003 DE-He213
005 20240730183636.0
007 cr nn 008mamaa
008 180629s2018 sz | s |||| 0|eng d
020 _a9783319942056
_9978-3-319-94205-6
024 7 _a10.1007/978-3-319-94205-6
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aAutomated Reasoning
_h[electronic resource] :
_b9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings /
_cedited by Didier Galmiche, Stephan Schulz, Roberto Sebastiani.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXVIII, 724 p. 128 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v10900
505 0 _aAn Assumption-Based Approach for Solving The Minimal S5-Satisfiability Problem -- FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics -- Superposition for Lambda-Free Higher-Order Logic -- Automated Reasoning about Key Sets -- A Tableaux Calculus for Reducing Proof Size -- FORT 2.0 -- Formalizing Bachmair and Ganzinger's Ordered Resolution Prover -- The Higher-Order Prover Leo-III -- Well-Founded Unions -- Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories -- Cubicle-W: Parameterized Model Checking on Weak Memory -- QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property -- A Why3 framework for reflection proofs and its application to GMP's algorithms -- Infinitely-valued Logic -- Uniform Substitution for Differential Game Logic -- A Logical Framework with Commutative and Non-Commutative Subexponentials -- Exploring Approximations for Floating-Point Arithmetic using UppSAT -- Complexity of Combinations of Qualitative Constraint Satisfaction Problems -- A Generic Framework for Implicate Generation Modulo Theories -- A Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting Systems -- A New Probabilistic Algorithm for Approximate Model Counting -- A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems -- Cops and CoCoWeb: Infrastructure for Conuence Tools -- Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing -- Superposition with Datatypes and Codatatypes -- Efficient encodings of first-order Horn formulas in equational logic -- A FOOLish Encoding of the Next State Relations of Imperative Programs -- Constructive Decision via Redundancy-free Proof-Search -- Deciding the First-Order Theory of an Algebra of Feature Trees with Updates -- A Separation Logic with Data: Small Models and Automation -- MaedMax: A Maximal Ordered Completion Tool -- From Syntactic Proofs to Combinatorial Proofs -- A Resolution-Based Calculus for Preferential Logics -- Extended Resolution Simulates DRAT -- Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle -- Efficient Interpolation for the Theory of Arrays -- ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback -- Theories as Types -- Datatypes with Shared Selectors -- Enumerating Justifications using Resolution -- A SAT-Based Approach to Learn Explainable Decision Sets -- Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions -- An abstraction-refinement framework for reasoning with large theories -- Efficient Model Construction for Horn Logic with VLog: System Description -- Focussing, MALL and the polynomial hierarchy -- Checking Array Bounds by Abstract Interpretation and Symbolic Expressions.
520 _aThis book constitutes the refereed proceedings of the 9th International Joint Conference on Automated Reasoning, IJCAR 2018, held in Oxford, United Kingdom, in July 2018, as part of the Federated Logic Conference, FLoC 2018. In 2018, IJCAR unites CADE, TABLEAUX, and FroCoS, the International Symposium on Frontiers of Combining Systems, and, for the fourth time, is part of the Federated Logic Conference. The 38 revised full research papers and 8 system descriptions presented together with two invited talks were carefully reviewed and selected from 108 submissions. The papers focus on topics such as logics, deductive systems, proof-search methods, theorem proving, model checking, verification, formal methods, and program analysis.
650 0 _aMachine theory.
_9132864
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 1 4 _aFormal Languages and Automata Theory.
_9132865
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aAlgorithms.
_93390
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
700 1 _aGalmiche, Didier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9132866
700 1 _aSchulz, Stephan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9132867
700 1 _aSebastiani, Roberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9132868
710 2 _aSpringerLink (Online service)
_9132869
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319942049
776 0 8 _iPrinted edition:
_z9783319942063
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v10900
_9132870
856 4 0 _uhttps://doi.org/10.1007/978-3-319-94205-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91969
_d91969