Automated Reasoning for EXplainable Artificial Intelligence Maria Paola Bonacina Dipartimento di Informatica Universit` a degli Studi di Verona

Source URL: www.cs.man.ac.uk

• Artificial intelligence
• Logic
• Cognitive science
• Automated reasoning
• Reasoning
• Accountability
• Technology
• Automated theorem proving
• Explainable Artificial Intelligence
• Xai
• Inference

Automated Reasoning for Explainable Artificial Intelligence∗ Maria Paola Bonacina1 Dipartimento di Informatica Universit` a degli Studi di Verona Strada Le Grazie 15

Source URL: www.cs.man.ac.uk

• Artificial intelligence
• Cognitive science
• Logic
• Cognition
• Cybernetics
• Automated reasoning
• Automated theorem proving
• Computational neuroscience
• Explainable Artificial Intelligence
• Mark E. Stickel
• Reason
• Inference

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Self-Formalisation of Higher-Order Logic Semantics, Soundness, and a Verified Implementation Ramana Kumar · Rob Arthan ·

Source URL: cakeml.org

• Mathematical logic
• Mathematics
• Logic
• Logic in computer science
• Proof assistants
• Model theory
• Proof theory
• Foundations of mathematics
• ZermeloFraenkel set theory
• HOL
• Gdel's completeness theorem
• Gdel's incompleteness theorems

Automated Deduction for Verification Natarajan Shankar SRI International Automated deduction uses computation to perform symbolic logical reasoning. It has been a core technology for program verification from the very be

Source URL: dream.inf.ed.ac.uk

• Logic
• Mathematical logic
• Mathematics
• Model theory
• Propositional calculus
• Logic in computer science
• Logical truth
• Linear temporal logic
• First-order logic
• Well-formed formula
• Interpretation
• Intuitionistic logic

arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition,

Source URL: arxiv.org

• Cryptography
• Algebra
• Mathematics
• Linear algebra
• Computational number theory
• Lattice points
• Lattice-based cryptography
• Post-quantum cryptography
• LenstraLenstraLovsz lattice basis reduction algorithm
• Lattice reduction
• Lattice
• GramSchmidt process

SMT Workshop’07 5th International Workshop on Satisfiability Modulo Theories (Previously called PDPAR: Pragmatics of Decision Procedures in Automated Reasoning) Affiliated with CAV’07 Berlin, Germany, 1-2 July 2007

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Logic in computer science
• Formal methods
• Logic
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Formal verification
• SMT
• Automated reasoning
• Satisfiability

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Source URL: www.chargueraud.org

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Source URL: chargueraud.org

• Software engineering
• Computer programming
• Computing
• Functional languages
• Data types
• Type theory
• Logic in computer science
• Automated theorem proving
• OCaml
• Coq
• Disjoint-set data structure
• Proof assistant

Call for Papers Special issue of the AI Communications journal on Automated Reasoning IMPORTANT DATES Abstract submission: January 8, 2017

Source URL: cs.ru.nl