Automated Reasoning 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3–6, 2024, Proceedings, Part I
This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full research papers and 6 short papers presented in this book were carefully reviewed and selected f...
Uložené v:
| Hlavní autori: | , , |
|---|---|
| Médium: | E-kniha |
| Jazyk: | English |
| Vydavateľské údaje: |
Cham
Springer Nature
2024
Springer |
| Vydanie: | 1 |
| Edícia: | Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence |
| Predmet: | |
| ISBN: | 9783031634987, 3031634985, 3031634977, 9783031634970 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full research papers and 6 short papers presented in this book were carefully reviewed and selected from 115 submissions. The papers focus on the following topics: theorem proving and tools; SAT, SMT and Quantifier Elimination; Intuitionistic Logics and Modal Logics; Calculi, Proof Theory and Decision Procedures; and Unification, Rewriting and Computational Models. This book is open access. |
|---|---|
| AbstractList | This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full research papers and 6 short papers presented in this book were carefully reviewed and selected from 115 submissions. The papers focus on the following topics: theorem proving and tools; SAT, SMT and Quantifier Elimination; Intuitionistic Logics and Modal Logics; Calculi, Proof Theory and Decision Procedures; and Unification, Rewriting and Computational Models. This book is open access. |
| Author | Schmidt, Renate A Benzmüller, Christoph Heule, Marijn J. H |
| Author_xml | – sequence: 1 fullname: Benzmüller, Christoph – sequence: 2 fullname: Heule, Marijn J. H – sequence: 3 fullname: Schmidt, Renate A |
| BookMark | eNpdTjtPwzAQNuIhaOnEhMTAyGI4--ycPTCUqjykSkgIsVpuYleBNi5JOvDvcSkDYrq7777XgB00qQmMnQu4FgB0Y8lw5ICCF6is4bTHRhnDjPwAtP_vPmIDoZQ2SEUBx2zUde8AgBIRQJ-ws_GmTyvfh-ryJfguNXWzOGWH0S-7MPqdQ_Z2P32dPPLZ88PTZDzjXipEwyOFkL1KEkoItNGqSGgqMloYkCTEHApjSl-ZQtuootLeKIyqkorIUolDdrUzXrfpcxO63oV5Sh9laPrWL930boJCy9wTMvV2R01-HRq3buuVb79c8rVb1vN2t28_qV04CU4DOCELTc5KVJT1F3_1VfLbpM4Jlcso_AbwvV-f |
| ContentType | eBook |
| DBID | V1H A7I |
| DOI | 10.1007/978-3-031-63498-7 |
| DatabaseName | DOAB: Directory of Open Access Books OAPEN |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: V1H name: DOAB: Directory of Open Access Books url: https://directory.doabooks.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISBN | 9783031634987 3031634985 |
| Edition | 1 |
| Editor | Heule, Marijn J.H Schmidt, Renate A Benzmüller, Christoph |
| Editor_xml | – sequence: 1 fullname: Benzmüller, Christoph – sequence: 2 fullname: Heule, Marijn J.H – sequence: 3 fullname: Schmidt, Renate A |
| ExternalDocumentID | EBC31520050 oai_library_oapen_org_20_500_12657_92347 142474 |
| GroupedDBID | A7I AABBV AACKP AAHEH AAKKN AALJR AAQKC ABEEZ ABHYI ABLGM ADZDO AEDXK AEIVC AEKFX AFIJG AGWHU AIQUZ ALMA_UNASSIGNED_HOLDINGS ALNDD BBABE CZZ EIXGO IEZ SBO TPJZQ TSXQS V1H Z83 Z88 |
| ID | FETCH-LOGICAL-a24338-f7ee000c7141139f94f738d7851802711b0688cad8659f4f45a843f4d247797c3 |
| IEDL.DBID | V1H |
| ISBN | 9783031634987 3031634985 3031634977 9783031634970 |
| IngestDate | Wed Jun 11 00:19:39 EDT 2025 Wed Dec 10 14:55:14 EST 2025 Tue Oct 07 23:58:14 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA267-268.5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a24338-f7ee000c7141139f94f738d7851802711b0688cad8659f4f45a843f4d247797c3 |
| OCLC | 1445837660 |
| OpenAccessLink | https://directory.doabooks.org/handle/20.500.12854/142474 |
| PQID | EBC31520050 |
| PageCount | 482 |
| ParticipantIDs | proquest_ebookcentral_EBC31520050 oapen_primary_oai_library_oapen_org_20_500_12657_92347 oapen_doabooks_142474 |
| PublicationCentury | 2000 |
| PublicationDate | 2024 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – year: 2024 text: 2024 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Cham |
| PublicationSeriesTitle | Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence |
| PublicationYear | 2024 |
| Publisher | Springer Nature Springer |
| Publisher_xml | – name: Springer Nature – name: Springer |
| SSID | ssj0003233005 |
| Score | 2.383416 |
| Snippet | This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in... |
| SourceID | proquest oapen |
| SourceType | Publisher |
| SubjectTerms | Artificial intelligence Automated reasoning Computer hardware Computer programming / software engineering Computer science Computing and Information Technology Deontic Logic Description logics Equational logic and rewriting First-order logic Higher order logic Interactive proof systems Intuitionistic Logics Logic Logic and verification Mathematical theory of computation Modal and temporal logics Modal Logics Non-classical Logics Programming logic Proof theory Rewriting Satisfiability Solving Separation logic Software Engineering Theorem Proving |
| Subtitle | 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3–6, 2024, Proceedings, Part I |
| TableOfContents | 4 -Graphs and Bisimulations -- 5 Definability -- 6 Model Completeness -- 7 Conclusions, Related and Further Work -- References -- Certifying Phase Abstraction -- 1 Introduction -- 2 Background -- 3 Periodic Signals -- 4 Extending Phase Abstraction -- 5 Certification -- 5.1 Restricted Simulation -- 5.2 Certifying Phase Abstraction -- 6 Implementation -- 7 Experimental Evaluation -- 8 Conclusion -- References -- Verifying a Realistic Mutable Hash Table -- 1 Introduction -- 1.1 Related Work -- 2 LongMap: From Scala Library to Stainless -- 2.1 Adapting for Verification -- 3 Specification and Verification -- 3.1 Decorator Design Pattern for Modular Proofs -- 3.2 Swap Operation for More Expressive Unique Reference -- 3.3 Finding and Confirming a Bug in the Original Implementation -- 3.4 SMT Queries -- 4 Evaluation -- 5 Conclusion -- References -- Booleguru, the Propositional Polyglot (Short Paper) -- 1 Introduction -- 1.1 Bridging the Solver Gap with Propositional Logic -- 1.2 Related Work -- 2 Booleguru, the Propositional Multitool -- 2.1 Representing Propositional Formulas in Memory -- 2.2 Parsing Formulas -- 2.3 Transforming Formulas -- 2.4 Serializing Formulas -- 3 Booleguru, the Programming Environment -- 3.1 Command-Line Interactive Interface -- 3.2 Developing Booleguru -- 4 Conclusion -- References -- Quantifier Shifting for Quantified Boolean Formulas Revisited -- 1 Introduction -- 2 Preliminaries -- 3 Related Work -- 4 Quantifier Shifting -- 4.1 Linearizations over Quantrees -- 4.2 Alternation Height of Quantrees -- 5 Linearization Strategies -- 5.1 Strategies as Preferences over Linearizations -- 5.2 Optimal Linearizations over a Strategy -- 6 Implementation and Evaluation -- 6.1 Benchmarks -- 6.2 Experimental Setup -- 6.3 Experimental Results -- 7 Conclusion and Future Work -- References -- Satisfiability Modulo Exponential Integer Arithmetic 1 Introduction -- 2 Preliminaries -- 3 The SMT Theory EIA -- 4 Solving EIA Problems via CEGAR -- 4.1 Preprocessings -- 4.2 Refinement -- 5 Related Work -- 6 Implementation and Evaluation -- 7 Conclusion -- References -- SAT-Based Learning of Computation Tree Logic -- 1 Introduction -- 2 Preliminary Definitions -- 2.1 Kripke Structures -- 2.2 Computation Tree Logic -- 2.3 Bounded Semantics -- 3 The Learning Problem -- 3.1 Introducing the Problem -- 3.2 An Explicit Solution -- 4 SAT-Based Learning -- 4.1 Modelling the Formula -- 4.2 Applying the Formula to the Sample -- 4.3 Solving the SAT Instance -- 5 Algorithms for the Minimal Learning Problem -- 5.1 A Bottom-Up Algorithm -- 5.2 Embedding Negations -- 5.3 Optimizations and Alternatives -- 6 Experimental Implementation -- 6.1 Benchmark Collection -- 6.2 Quantitative Evaluation -- 7 Conclusion and Further Developments -- A Proof of Theorem 3 -- B Proof of Theorem 5 -- C Proof of Corollary 1 -- References -- MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper) -- 1 Introduction -- 2 Preliminaries -- 3 Usability of SMT Solving in Finite Fields -- 4 Implementation Details -- 5 Evaluation -- 6 Summary and Outlook -- References -- Certified MaxSAT Preprocessing -- 1 Introduction -- 1.1 Previous Work -- 1.2 Our Contribution -- 1.3 Organization of This Paper -- 2 Preliminaries -- 2.1 Pseudo-Boolean Proof Logging Using Cutting Planes -- 2.2 Maximum Satisfiability -- 3 Proof Logging for MaxSAT Preprocessing -- 3.1 Overview -- 3.2 Worked Example of Certified Preprocessing -- 4 Verified Proof Checking for Preprocessing Proofs -- 4.1 Output Section for Pseudo-Boolean Proofs -- 4.2 Verified Proof Checking for Reformulations -- 4.3 Verified WCNF Frontend -- 5 Experiments -- 6 Conclusion -- References -- A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations Intro -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Invited Contributions -- Automated Reasoning for Mathematics -- 1 The Origins and Foundations of Automated Reasoning -- 2 Taking Stock -- 3 A Personal History -- 4 Domain-General Reasoning for Verification -- 5 Domain-Specific Reasoning for Verification -- 6 Automation for the Discovery of New Theorems -- 7 Machine Learning and Symbolic AI -- 8 Conclusions -- References -- Induction in Saturation -- 1 Introduction -- 2 Induction in Saturation - In a Nutshell -- 3 Induction and Arithmetic -- 4 Induction over Arrays -- 5 Induction over Lists -- 6 Conclusions and Outlook -- References -- Stepping Stones in the TPTP World -- 1 Introduction -- 2 The TPTP Language -- 3 The TPTP Problem Library -- 4 The TSTP Solution Library -- 5 The SZS Ontologies -- 6 Specialist Problem Classes -- 7 Problem Difficulty Ratings -- 8 SystemOnTPTP and StarExec -- 9 The CADE ATP System Competition -- 10 TPTP World Users -- 11 Conclusion -- References -- Theorem Proving and Tools -- An Empirical Assessment of Progress in Automated Theorem Proving -- 1 Introduction -- 2 The TPTP Problem Library -- 2.1 Specialist Problem Classes -- 2.2 TPTP Problem Ratings -- 3 The TSTP Solution Library -- 3.1 Resource Limits -- 4 Analysis Processes -- 4.1 Analysis Data -- 4.2 Coherent SPC Sets -- 4.3 Six Analyses -- 5 Evidence of Progress -- 5.1 First Solutions -- 5.2 Solutions and Ratings -- 6 Conclusion -- References -- A Higher-Order Vampire (Short Paper) -- 1 Introduction -- 2 Preliminaries -- 3 Calculus -- 4 Implementation -- 5 Strategies and the Schedule -- 6 Related Work -- 7 Conclusion -- References -- Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic -- 1 Introduction -- 2 Preliminaries -- 2.1 HOL -- 2.2 DHOL -- 2.3 Erasure -- 3 Tableau Calculus for DHOL -- 3.1 Rules 3.2 Soundness and Completeness -- 4 Implementation -- 4.1 Type Checking -- 4.2 Implementation of the Rules -- 4.3 Generating Instantiations -- 5 Case Study: List Reversal Is an Involution -- 6 Conclusion -- References -- The Naproche-ZF Theorem Prover (Short Paper) -- 1 Introduction -- 2 Controlled Natural Language -- 3 Semantics and Proof Checking -- 4 Conclusion and Future Work -- References -- Reducibility Constraints in Superposition -- 1 Introduction -- 2 Preliminaries -- 3 Reducibility Constraints -- 4 Model Construction in BLINC -- 5 Redundancy Detection in BLINC -- 6 Evaluation -- 7 Related Work -- 8 Conclusions -- References -- First-Order Automatic Literal Model Generation -- 1 Introduction -- 2 Preliminaries -- 3 SCL: Clause Learning from Simple Models -- 4 Generating Models -- 5 Conclusion and Future Work -- References -- Synthesis of Recursive Programs in Saturation -- 1 Introduction -- 2 Preliminaries -- 3 Recent Developments in Saturation -- 4 Saturation with Induction in Constructive Logic -- 5 Induction with Magic Formulas -- 6 Programs with Primitive Recursion -- 7 Recursive Synthesis in Saturation -- 8 Generalization to Arbitrary Term Algebras -- 9 Implementation and Examples -- 10 Related Work -- 11 Conclusions -- References -- Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic -- 1 Introduction -- 2 Background -- 2.1 Notation -- 2.2 Strong Equivalence as First-Order Equivalence -- 2.3 Definition Synthesis with Craig Interpolation -- 3 Variations of Craig Interpolation and Beth Definability for Logic Programs -- 3.1 Extracting Logic Programs from a First-Order Encoding -- 3.2 A Refinement of Craig Interpolation for Logic Programs -- 3.3 Effective Projective Definability of Logic Programs -- 3.4 Constraining Positions of Predicates Within Rules 4 Prototypical Implementation -- 5 Conclusion -- References -- Regularization in Spider-Style Strategy Discovery and Schedule Construction -- 1 Introduction -- 2 Preliminaries -- 2.1 Spider-Style Strategy Discovery and Schedule Construction -- 2.2 CPU Instructions as a Measure of Time -- 3 Strategy Discovery Experiment -- 3.1 Initial Strategy and Varying Instruction Limits -- 3.2 Problem Sampling -- 3.3 Strategy Sampling -- 3.4 Impact of Strategy Optimization -- 3.5 Parsing Does Not Count -- 4 One Schedule to Cover Them All -- 5 Greedy Schedule Construction -- 5.1 Do We Need a Budget? -- 6 Regularization in Schedule Construction -- 6.1 Regularization Methods -- 6.2 Experimental Results -- 7 Related Work -- 8 Conclusion -- A Experimental Results on Various Budgets -- References -- Lemma Discovery and Strategies for Automated Induction -- 1 Introduction -- 2 Background -- 2.1 QuickSpec -- 2.2 Induction in Vampire -- 3 Implementation -- 3.1 Conjectured Lemmas, AVATAR, and Vampire's Claims -- 3.2 Proving Strategies and a New Induction Schedule -- 4 Evaluation -- 4.1 TIP Benchmarks -- 4.2 Results -- 5 Discussion -- 5.1 Future Work -- References -- Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper) -- 1 Introduction -- 2 Preliminaries -- 3 Control-Flow Refinement for PIPs -- 4 Implementation, Evaluation, and Conclusion -- References -- On the (In-)Completeness of Destructive Equality Resolution in the Superposition Calculus -- 1 Introduction -- 2 Preliminaries -- 3 Incompleteness -- 4 Completeness, Part I: The Horn Case -- 4.1 The Idea -- 4.2 Ground Case -- 4.3 Lifting -- 4.4 Deletion and Simplification -- 5 Completeness, Part II: The Non-horn Case -- 6 Discussion -- References -- SAT, SMT and Quantifier Elimination -- Model Completeness for Rational Trees -- 1 Introduction -- 2 Preliminaries -- 3 -Trees 1 Introduction |
| Title | Automated Reasoning |
| URI | https://directory.doabooks.org/handle/20.500.12854/142474 https://library.oapen.org/handle/20.500.12657/92347 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=31520050 |
| Volume | 14739 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BywBLoRRRHlWRWA2OH7EzQtWqDFQIoaqblTqOxJJUTcvv55xHVYSYGC83JD479nd3vu8A7p2vO3DoljDlKBGJdSS2KSOCWYHnc0RRKJtNqNlMLxbR216rr2ojz_2t5jz2OLMo0_kV5QB66g-SekYELcWjr9FS4hDa6OJIf5trHkx34RXOuCdi99UcuGxDLhDn7AlaVuQ7OyX9KWvVZEBrElpOUENKFVG-OVK8ctmv_bs8lCadfwznFNrOVzmcwYHLutBpejsM61-9CyevOz7X4hy6T9tNjoJLhu8uLsoQbg_mk_HHaErqdgokZgI9UZIqh1NDrQpEgMAvjUSquE4Ugi6N3mkQLH0HGhsnOpRRKlIhYy14KhL8MBUpyy-gleWZu4Th0gNNGlpHtUUIkCwdk4myglo0ZcBlH3qlhUwzbFMNrw9h9XxVcWkYz25dx6tMpUH7GEYNGsYELJTKIAQVqg93jalNmUau766a8fOIB547StKrP156DccMoUgVOLmB1ma9dbdwZL82n8V6gGhavQzK1fMNjdu4Wg |
| linkProvider | Open Access Publishing in European Networks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Automated+Reasoning&rft.series=Lecture+Notes+in+Computer+Science%3B+Lecture+Notes+in+Artificial+Intelligence&rft.date=2024-01-01&rft.pub=Springer+Nature&rft.isbn=9783031634987&rft_id=info:doi/10.1007%2F978-3-031-63498-7&rft.externalDBID=V1H&rft.externalDocID=142474 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783031634987/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783031634987/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783031634987/sc.gif&client=summon&freeimage=true |