seminar topic assignment
TRANSCRIPT
Seminars @ Knowledge-based Systems Group 192-03 [2ex] WS 2020/21
[2ex] Seminar Topic AssignmentWS 2020/21
www.kr.tuwien.ac.at
ä Seminar in Artificial Intelligence
ä Seminar in Logic
Organisation:
ä Any of the topics listed next can be chosen for any of the above offered seminars.
ä A 40min presentation has to be prepared.
ä The talks will be given at the end of the semester.
1/22
ä Physics Nobel Laureate 2020 Roger Penrose on AI
ä Cognitive Psychology and its Implications
ä History of Logic I
Topics Group Eiter
ä Artificial Intelligence
ä Ontology-Based Data Access
Topics Group Egly
ä Solvers and Proof Systems for QBFs
Assignment
+ If you are interested in a topic of Group X , then please write an email with subject “KBS Seminar” to person X .
3/22
1. T. Skura. Refutation systems in propositional logic. Handbook of Philosophical Logic, 2011.
2. V. Goranko and T. Skura. Refutation systems in the finite. Reasoning: Games, Cognition, Logic, College Publications, 2020.
3. A. Tamminga. Logics of rejection: two systems of natural deduction. Logique & Analyse, 1994.
4. T. Skura. A refutation theory. Logica Universalis, 2009.
5. R. Caferra, N. Peltier. Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Int. Journal of Intelligent Systems 23, 2008.
6. V. Goranko. Refutation systems in modal logic. Studia Logica, 1994.
7. R. Dutkiewicz. The method of axiomatic rejection for the intuitionistic propositional calculus. Studia Logica, 1989.
4/22
Refutation Calculi (ctd.)
8. Olaf Beyersdorff, Leroy Chew: The Complexity of Theorem Proving in Circumscription and Minimal Entailment. IJCAR 2014: 403-417
9. Olaf Beyersdorff: The Complexity of Theorem Proving in Autoepistemic Logic. SAT 2013: 365-376.
10. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. Journal of Logic and Computation 22(3): 587-604, 2012.
5/22
Quantum Logic: Basics and Proof Theory
ä M. L. Dalla Chiara and R. Giuntini. Quantum Logics. Handbook of Philosophical Logic Vol. 6, 2002.
ä H. Nishimura. Gentzen Methods in Quantum Logic. Handbook of Quantum Logic and Quantum Structures, 2009.
ä Natural Deduction System for Quantum Logic. In: P. Gibbins, Particles and Paradoxes, Cambridge University Press, 1987.
ä N. Kamide. Proof Theory of Paraconsistent Quantum Logic. Journal of Philosophical Logic, 2017.
6/22
Physics Laureate 2020 Roger Penrose on AI
ä Roger Penrose: The Emperor’s New Mind - Concerning Computers, Minds, and the Laws of Physics, 1989
• From the Contents:
2. Algorithms and Turing Machines
3. Mathematics and Reality
5. Real Brains and Model Brains
6. Where Lies the Physics of Mind?
ä Roger Penrose: Shadows of the Mind, 1994 • From the Contents:
1. Consciousness and computation
2. The Godelian case
4. Quantum theory and the brain 7/22
Empty Head
Cognitive Psychology and its Implications
ä John R. Anderson: Cognitive Psychology and its Implications, Eighth Edition, 2014
ä From the Contents:
1. Perception 2. Attention and Performance 3. Mental Imagery 4. Representation of Knowledge 5. Human Memory 6. Problem Solving 7. Expertise 8. Reasoning 9. Judgement and Decision Making
10. Language Structure 11. Language Comprehension 12. Individual Differences in Cognition
8/22
ä Topics (not exhaustive):
• Clarence Irving Lewis (1883 - 1964):
– A Survey of Symbolic Logic. Berkeley 1918.
– Lewis, Langford: Symbolic Logic, 1932 (corr. reprint 1959).
• Rudolf Carnap (1891 - 1970):
– Meaning and Necessity: A Study in Semantics and Modal Logic, 1947
9/22
ä Logicomix
• an entertaining journey through the beginnings of Modern Formal Logic • tell the story and zoom into some technical aspect
10/22
ä Godel and Carnap in Vienna, Tarski in Vienna
• read some articles texts in books about the science spirit of the 1930s • report about fascinating times
11/22
Knowledge Representation and Reasoning
ä Streams and Events • Stream Reasoning in Temporal Datalog (AAAI18) • Monitoring Temporal Properties of Continuous Signals (Signal
Temporal Logic) (FORMATS/FTRTFT’04) • A Formal Framework for Complex Event Processing (ICDT’19) • RDF Stream Reasoning via Answer Set Programming (ISWC’18)
ä Contextual Reasoning • Multi-context systems in dynamic environments (AMAI’19) • An ASP approach for reasoning in a concept-aware
multipreferential lightweight DL (TPLP’20)
ä Answer Set Programming • Train Scheduling with Hybrid ASP (Abels et al., LPNMR’19) • Routing Driverless Transport Vehicles in Car Assembly with Answer
Set Programming (TPLP’18) • Out of Sight But Not Out of Mind: Traffic analysis in ASP (IJCAI
2019) • ASP Microservices: An application of Answer Set Programming in
Distributed Architectures (ICLP’20) • Answer Set Programming with Constraints (ECAI’20)
12/22
ä Combining Subsymbolic and Symbolic AI
• NeurASP: Embracing Neural Networks into Answer Set Programming (IJCAI’20) • Logic tensor networks (NESY16, IJCAI’17) • The Logical Expressiveness of Graph Neural Networks (ICLR 2020) • Deep ProbLog: Neural probabilistic logic programming (NIPS’18) • Neurocore: Guiding high-performance SAT solvers with
unsat-core predictions (CoRR’19)
• Learning Heuristics For Quantified Boolean Formulas Through Reinforcement Learning (ICLR’20) • A SAT-Based Approach to Learn Explainable Decision Sets
(IJCAR’18) • Learning SMT(LRA) Constraints using SMT Solvers (IJCAI’18) • Learning MAX-SAT from Contextual Examples for Combinatorial
Optimisation (AAAI’20) • Induction of Subgoal Automata for Reinforcement Learning
(AAAI’20) 13/22
Artifical Intelligence, cont’d
ä General Artificial Intelligence
• Road to Conscious Machines: The Story of AI (Michael Wooldridge, Penguin Books,’20), focus on last chapter
ä AI Highlights / Challenges
• Kidney/Organ Exchange (AAAI16, AAAI’12) • Making Contextual Decisions with Low Technical Debt (Real World
Reinforcement Learning Team, Microsoft ACM SIGAI Industry Award, 2019) • . . .
Access to papers: http://www.kr.tuwien.ac.at/education/seminars/
ä Fairness in Machine Learning by Barocas, Hardt, Narayanan New book (in progress, https://fairmlbook.org/) Choose one chapter: • 2. Classification: formal non-discrimination criteria
• 3. Causality: causal inference and its role in fairness
• 4. Testing Discrimination in Practice ä Fairness Is Not Static: Deeper Understanding of Long Term Fairness
via Agents and Environments (D’Amour et al., FAccT’20) ä Fairness in Relational Domains Farnadi, Babaki, Getoor (AIES ’18)
Accountability What to account for when accounting for algorithms: A systematic literature review on algorithmic accountability (Wieringa, FAccT’20) Responsible AI / HI A Research Agenda for Hybrid Intelligence: Augmenting Human Intellect With Collaborative, Adaptive, Responsible, and Explainable Artificial Intelligence (Akata et al., 2020)
16/22
OBDA and VKGs
ä Virtual Knowledge Graphs: An Overview of Systems and Use Cases Xiao, Ding, Cogrel and Calvanese, 2019
ä Ontology-based access to temporal data with Ontop: A framework proposal Guzel-Kalayci et al., 2019
ä Enriching Ontology-based Data Access with Provenance Calvanese et al., 2020
ä A Framework Uniting Ontology-Based Geodata Integration and Geovisual Analytics Xiao, Ding, Cogrel and Calvanese, 2020
ä Privacy-preserving Ontology-based Data Access Cima, Lembo, Marconi, Rosati and Savo, ISWC 2020
17/22
Shapes Constraint Language (SHACL) new W3C recommendation, constraint language for RDF data
ä Validating SHACL Constraints over a SPARQL Endpoint Corman et al., ISWC 2019
ä Deciding SHACL Shape Containment through Description Logics Reasoning Leinberger et al., ISWC 2020
ä SHACL Satisfiability and Containment Pareti, et al., ISWC 2020
18/22
ä New standard: GQL http://www.gqlstandards.org
Investigate the status of the language, features, data model, relation to existing languages
ä Foundations of Modern Query Languages for Graph Databases Angles et al. ACM Computing Surveys, 2017 https://doi.org/10.1145/3104031
ä Navigational and Rule-Based Languages for Graph Databases Reutter and Vrgoc, Reasoning Web 2016 http://doi.org/10.1007/978-3-319-49493-7_3
Quantum algorithms
ä Starting point: [Montanoru’s review article @ https://www.nature.com/articles/npjqi201523]
• Classical papers (Landauer’61, Bennett’73, Toffoli’80, Deutsch’85, etc.)
• QAs based on quantum fourier transform Deutsch–Jozsa, Simon, Shor, Hidden subgroups, Gaus sums
• QAs based on amplitude amplification Grover, quantum counting, SAT on a QC
• QAs based on quantum walks Triangle-finding problem, formula eval., group commutativity
Quantum Computing and Quantum Algorithms
ä Programming languages for quantum computers imperative (QCL, Q#, Q|SI>, Q language, qGCL, QASM) functional (QML, Quantum lambda calculi, Quipper)
ä QC frameworks (simulators [link], IBM’s open framework Qiskit, ETH ProjectQ, etc.)
ä Quantum machine learning: Starting point: [Wikipedia entry]
Solvers and Proof Systems for QBFs
ä QBF solving more and more important for practical application (e.g., synthesis)
ä What QBF solvers are available, what is their performance?
ä Papers
• Janota, Marques-Silva: Solving QBF by clause selection, IJCAI’15
• Rabe, Tentrup: CAQE: A certifing QBF solver, FMCAD 2015
• Tu et al.: QELL: QBF reasoning with extended clause learning and levelized SAT solving, SAT 2015.
• Also very interesting proof theory topics: (e.g., LK for QBFs)
22/22
www.kr.tuwien.ac.at
ä Seminar in Artificial Intelligence
ä Seminar in Logic
Organisation:
ä Any of the topics listed next can be chosen for any of the above offered seminars.
ä A 40min presentation has to be prepared.
ä The talks will be given at the end of the semester.
1/22
ä Physics Nobel Laureate 2020 Roger Penrose on AI
ä Cognitive Psychology and its Implications
ä History of Logic I
Topics Group Eiter
ä Artificial Intelligence
ä Ontology-Based Data Access
Topics Group Egly
ä Solvers and Proof Systems for QBFs
Assignment
+ If you are interested in a topic of Group X , then please write an email with subject “KBS Seminar” to person X .
3/22
1. T. Skura. Refutation systems in propositional logic. Handbook of Philosophical Logic, 2011.
2. V. Goranko and T. Skura. Refutation systems in the finite. Reasoning: Games, Cognition, Logic, College Publications, 2020.
3. A. Tamminga. Logics of rejection: two systems of natural deduction. Logique & Analyse, 1994.
4. T. Skura. A refutation theory. Logica Universalis, 2009.
5. R. Caferra, N. Peltier. Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Int. Journal of Intelligent Systems 23, 2008.
6. V. Goranko. Refutation systems in modal logic. Studia Logica, 1994.
7. R. Dutkiewicz. The method of axiomatic rejection for the intuitionistic propositional calculus. Studia Logica, 1989.
4/22
Refutation Calculi (ctd.)
8. Olaf Beyersdorff, Leroy Chew: The Complexity of Theorem Proving in Circumscription and Minimal Entailment. IJCAR 2014: 403-417
9. Olaf Beyersdorff: The Complexity of Theorem Proving in Autoepistemic Logic. SAT 2013: 365-376.
10. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. Journal of Logic and Computation 22(3): 587-604, 2012.
5/22
Quantum Logic: Basics and Proof Theory
ä M. L. Dalla Chiara and R. Giuntini. Quantum Logics. Handbook of Philosophical Logic Vol. 6, 2002.
ä H. Nishimura. Gentzen Methods in Quantum Logic. Handbook of Quantum Logic and Quantum Structures, 2009.
ä Natural Deduction System for Quantum Logic. In: P. Gibbins, Particles and Paradoxes, Cambridge University Press, 1987.
ä N. Kamide. Proof Theory of Paraconsistent Quantum Logic. Journal of Philosophical Logic, 2017.
6/22
Physics Laureate 2020 Roger Penrose on AI
ä Roger Penrose: The Emperor’s New Mind - Concerning Computers, Minds, and the Laws of Physics, 1989
• From the Contents:
2. Algorithms and Turing Machines
3. Mathematics and Reality
5. Real Brains and Model Brains
6. Where Lies the Physics of Mind?
ä Roger Penrose: Shadows of the Mind, 1994 • From the Contents:
1. Consciousness and computation
2. The Godelian case
4. Quantum theory and the brain 7/22
Empty Head
Cognitive Psychology and its Implications
ä John R. Anderson: Cognitive Psychology and its Implications, Eighth Edition, 2014
ä From the Contents:
1. Perception 2. Attention and Performance 3. Mental Imagery 4. Representation of Knowledge 5. Human Memory 6. Problem Solving 7. Expertise 8. Reasoning 9. Judgement and Decision Making
10. Language Structure 11. Language Comprehension 12. Individual Differences in Cognition
8/22
ä Topics (not exhaustive):
• Clarence Irving Lewis (1883 - 1964):
– A Survey of Symbolic Logic. Berkeley 1918.
– Lewis, Langford: Symbolic Logic, 1932 (corr. reprint 1959).
• Rudolf Carnap (1891 - 1970):
– Meaning and Necessity: A Study in Semantics and Modal Logic, 1947
9/22
ä Logicomix
• an entertaining journey through the beginnings of Modern Formal Logic • tell the story and zoom into some technical aspect
10/22
ä Godel and Carnap in Vienna, Tarski in Vienna
• read some articles texts in books about the science spirit of the 1930s • report about fascinating times
11/22
Knowledge Representation and Reasoning
ä Streams and Events • Stream Reasoning in Temporal Datalog (AAAI18) • Monitoring Temporal Properties of Continuous Signals (Signal
Temporal Logic) (FORMATS/FTRTFT’04) • A Formal Framework for Complex Event Processing (ICDT’19) • RDF Stream Reasoning via Answer Set Programming (ISWC’18)
ä Contextual Reasoning • Multi-context systems in dynamic environments (AMAI’19) • An ASP approach for reasoning in a concept-aware
multipreferential lightweight DL (TPLP’20)
ä Answer Set Programming • Train Scheduling with Hybrid ASP (Abels et al., LPNMR’19) • Routing Driverless Transport Vehicles in Car Assembly with Answer
Set Programming (TPLP’18) • Out of Sight But Not Out of Mind: Traffic analysis in ASP (IJCAI
2019) • ASP Microservices: An application of Answer Set Programming in
Distributed Architectures (ICLP’20) • Answer Set Programming with Constraints (ECAI’20)
12/22
ä Combining Subsymbolic and Symbolic AI
• NeurASP: Embracing Neural Networks into Answer Set Programming (IJCAI’20) • Logic tensor networks (NESY16, IJCAI’17) • The Logical Expressiveness of Graph Neural Networks (ICLR 2020) • Deep ProbLog: Neural probabilistic logic programming (NIPS’18) • Neurocore: Guiding high-performance SAT solvers with
unsat-core predictions (CoRR’19)
• Learning Heuristics For Quantified Boolean Formulas Through Reinforcement Learning (ICLR’20) • A SAT-Based Approach to Learn Explainable Decision Sets
(IJCAR’18) • Learning SMT(LRA) Constraints using SMT Solvers (IJCAI’18) • Learning MAX-SAT from Contextual Examples for Combinatorial
Optimisation (AAAI’20) • Induction of Subgoal Automata for Reinforcement Learning
(AAAI’20) 13/22
Artifical Intelligence, cont’d
ä General Artificial Intelligence
• Road to Conscious Machines: The Story of AI (Michael Wooldridge, Penguin Books,’20), focus on last chapter
ä AI Highlights / Challenges
• Kidney/Organ Exchange (AAAI16, AAAI’12) • Making Contextual Decisions with Low Technical Debt (Real World
Reinforcement Learning Team, Microsoft ACM SIGAI Industry Award, 2019) • . . .
Access to papers: http://www.kr.tuwien.ac.at/education/seminars/
ä Fairness in Machine Learning by Barocas, Hardt, Narayanan New book (in progress, https://fairmlbook.org/) Choose one chapter: • 2. Classification: formal non-discrimination criteria
• 3. Causality: causal inference and its role in fairness
• 4. Testing Discrimination in Practice ä Fairness Is Not Static: Deeper Understanding of Long Term Fairness
via Agents and Environments (D’Amour et al., FAccT’20) ä Fairness in Relational Domains Farnadi, Babaki, Getoor (AIES ’18)
Accountability What to account for when accounting for algorithms: A systematic literature review on algorithmic accountability (Wieringa, FAccT’20) Responsible AI / HI A Research Agenda for Hybrid Intelligence: Augmenting Human Intellect With Collaborative, Adaptive, Responsible, and Explainable Artificial Intelligence (Akata et al., 2020)
16/22
OBDA and VKGs
ä Virtual Knowledge Graphs: An Overview of Systems and Use Cases Xiao, Ding, Cogrel and Calvanese, 2019
ä Ontology-based access to temporal data with Ontop: A framework proposal Guzel-Kalayci et al., 2019
ä Enriching Ontology-based Data Access with Provenance Calvanese et al., 2020
ä A Framework Uniting Ontology-Based Geodata Integration and Geovisual Analytics Xiao, Ding, Cogrel and Calvanese, 2020
ä Privacy-preserving Ontology-based Data Access Cima, Lembo, Marconi, Rosati and Savo, ISWC 2020
17/22
Shapes Constraint Language (SHACL) new W3C recommendation, constraint language for RDF data
ä Validating SHACL Constraints over a SPARQL Endpoint Corman et al., ISWC 2019
ä Deciding SHACL Shape Containment through Description Logics Reasoning Leinberger et al., ISWC 2020
ä SHACL Satisfiability and Containment Pareti, et al., ISWC 2020
18/22
ä New standard: GQL http://www.gqlstandards.org
Investigate the status of the language, features, data model, relation to existing languages
ä Foundations of Modern Query Languages for Graph Databases Angles et al. ACM Computing Surveys, 2017 https://doi.org/10.1145/3104031
ä Navigational and Rule-Based Languages for Graph Databases Reutter and Vrgoc, Reasoning Web 2016 http://doi.org/10.1007/978-3-319-49493-7_3
Quantum algorithms
ä Starting point: [Montanoru’s review article @ https://www.nature.com/articles/npjqi201523]
• Classical papers (Landauer’61, Bennett’73, Toffoli’80, Deutsch’85, etc.)
• QAs based on quantum fourier transform Deutsch–Jozsa, Simon, Shor, Hidden subgroups, Gaus sums
• QAs based on amplitude amplification Grover, quantum counting, SAT on a QC
• QAs based on quantum walks Triangle-finding problem, formula eval., group commutativity
Quantum Computing and Quantum Algorithms
ä Programming languages for quantum computers imperative (QCL, Q#, Q|SI>, Q language, qGCL, QASM) functional (QML, Quantum lambda calculi, Quipper)
ä QC frameworks (simulators [link], IBM’s open framework Qiskit, ETH ProjectQ, etc.)
ä Quantum machine learning: Starting point: [Wikipedia entry]
Solvers and Proof Systems for QBFs
ä QBF solving more and more important for practical application (e.g., synthesis)
ä What QBF solvers are available, what is their performance?
ä Papers
• Janota, Marques-Silva: Solving QBF by clause selection, IJCAI’15
• Rabe, Tentrup: CAQE: A certifing QBF solver, FMCAD 2015
• Tu et al.: QELL: QBF reasoning with extended clause learning and levelized SAT solving, SAT 2015.
• Also very interesting proof theory topics: (e.g., LK for QBFs)
22/22