The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin

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

• Logic
• Mathematical logic
• Mathematics
• Propositional calculus
• Logical truth
• Logic in computer science
• Syntax
• Automated theorem proving
• Resolution
• Frege system
• Boolean satisfiability problem
• First-order logic

Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California

Source URL: www.kestrel.edu

• Mathematical logic
• Logic
• Mathematics
• Model theory
• Automated theorem proving
• Predicate logic
• Semantics
• Logic programming
• Resolution
• First-order logic
• Skolem normal form
• Substitution

66 IEEE TRANSACTIONS ON HUMAN-MACHINE SYSTEMS, VOL. 46, NO. 1, FEBRUARY 2016 The GRASP Taxonomy of Human Grasp Types Thomas Feix, Javier Romero, Heinz-Bodo Schmiedmayer, Aaron M. Dollar, and Danica Kragic

Source URL: www.is.mpg.de

• Metaphysics
• Learning
• Child development
• Grasp
• Ontology
• Aptitude
• Motor control
• Motor skills
• Palmar grasp reflex
• Fine motor skill
• Thumb
• Taxonomy

OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a

Source URL: fantom.foundation

• Cryptocurrencies
• Computing
• Concurrent computing
• Fault-tolerant computer systems
• Distributed computing
• Distributed algorithms
• Theory of computation
• Cryptography
• Byzantine fault tolerance
• Blockchain
• Consensus
• Proof-of-stake

Incremental Runtime Verification of Probabilistic Systems Vojtˇech Forejt1 , Marta Kwiatkowska1 , David Parker2 , Hongyang Qu1 , and Mateusz Ujma1 1

Source URL: qav.comlab.ox.ac.uk

• Theoretical computer science
• Probability
• Formal methods
• Logic in computer science
• Model checkers
• Dynamic programming
• Stochastic control
• Model checking
• Markov decision process
• PRISM model checker
• Verification
• Runtime verification

Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2

Source URL: rjoshi.org

• Theoretical computer science
• Logic
• Formal methods
• Mathematical logic
• Model theory
• Interpretation
• Logic in computer science
• Propositional calculus
• Boolean satisfiability problem
• Automated theorem proving
• Propositional variable
• IP

1 “I Can’t Get No Satisfaction”: Helping Autonomous Systems Identify Their Unsatisfied Inter-domain Interests Juan Camilo Cardona, Stefano Vissicchio, Paolo Lucente, and Pierre Francois

Source URL: inl.info.ucl.ac.be

Specification Revision for Markov Decision Processes with Optimal Trade-off M. Lahijanian and M. Kwiatkowska Abstract— Optimal control policy synthesis for probabilistic systems from high-level specifications is increa

Source URL: qav.comlab.ox.ac.uk

• Logic
• 120-cell
• Linear temporal logic
• Substitution
• Markov decision process
• Symbol
• Theoretical computer science
• Mathematical logic

Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates Roberto Barbuti1 , Francesca Levi1 , Paolo Milazzo1 , and Guido Scatena2 1 2

Source URL: pages.di.unipi.it

• Probabilistic CTL
• Temporal logic
• Markov chain

The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff MIT MIT Universityof Toronto

Source URL: groups.csail.mit.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• Randomized algorithms
• Models of computation
• IP
• NP
• ArthurMerlin protocol
• Interactive proof system
• BPP
• PP
• Zero-knowledge proof