{"list":"other","total":72,"rows":[{"id":"2201.11903","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","created":"2022-01-28","cited_by_count":12459},{"id":"1602.04938","title":"\"Why Should I Trust You?\": Explaining the Predictions of Any Classifier","created":"2016-02-16","cited_by_count":5070},{"id":"2004.07780","title":"Shortcut Learning in Deep Neural Networks","created":"2020-04-16","cited_by_count":1969},{"id":"1909.01066","title":"Language Models as Knowledge Bases?","created":"2019-09-03","cited_by_count":1936},{"id":"2007.04612","title":"Concept Bottleneck Models","created":"2020-07-09","cited_by_count":1032},{"id":"1412.6575","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","created":"2014-12-20","cited_by_count":932},{"id":"1902.10197","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","created":"2019-02-26","cited_by_count":898},{"id":"2002.00388","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","created":"2020-02-02","cited_by_count":643},{"id":"2210.01240","title":"Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought","created":"2022-10-03","cited_by_count":337},{"id":"1901.09590","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","created":"2019-01-28","cited_by_count":290},{"id":"2010.01083","title":"Integrated Task and Motion Planning","created":"2020-10-02","cited_by_count":290},{"id":"1711.11157","title":"A Semantic Loss Function for Deep Learning with Symbolic Knowledge","created":"2017-11-29","cited_by_count":270},{"id":"1908.08351","title":"Compositionality decomposed: how do neural networks generalise?","created":"2019-08-22","cited_by_count":265},{"id":"2010.05953","title":"COMET-ATOMIC 2020: On Symbolic and Neural Commonsense Knowledge Graphs","created":"2020-10-12","cited_by_count":254},{"id":"1710.04806","title":"Deep Learning for Case-Based Reasoning through Prototypes: A Neural Network that Explains Its Predictions","created":"2017-10-13","cited_by_count":234},{"id":"2010.03950","title":"Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning","created":"2020-10-06","cited_by_count":191},{"id":"2201.02639","title":"MERLOT Reserve: Neural Script Knowledge through Vision and Language and Sound","created":"2022-01-07","cited_by_count":184},{"id":"2104.08661","title":"Explaining Answers with Entailment Trees","created":"2021-04-17","cited_by_count":152},{"id":"2102.12060","title":"Teach Me to Explain: A Review of Datasets for Explainable Natural Language Processing","created":"2021-02-24","cited_by_count":126},{"id":"2205.11502","title":"On the Paradox of Learning to Reason from Data","created":"2022-05-23","cited_by_count":93},{"id":"2307.07700","title":"NeurASP: Embracing Neural Networks into Answer Set Programming","created":"2023-07-15","cited_by_count":92},{"id":"2008.07912","title":"Inductive logic programming at 30: a new introduction","created":"2020-08-18","cited_by_count":85},{"id":"2301.12810","title":"Crawling the Internal Knowledge-Base of Language Models","created":"2023-01-30","cited_by_count":85},{"id":"1702.06879","title":"Knowledge Graph Completion via Complex Tensor Factorization","created":"2017-02-22","cited_by_count":80},{"id":"1709.06662","title":"Verifying Properties of Binarized Deep Neural Networks","created":"2017-09-19","cited_by_count":79},{"id":"1911.04326","title":"ASP-Core-2 Input Language Format","created":"2019-11-11","cited_by_count":77},{"id":"2105.11266","title":"Argumentative XAI: A Survey","created":"2021-05-24","cited_by_count":67},{"id":"2004.06025","title":"Learning from Rules Generalizing Labeled Exemplars","created":"2020-04-13","cited_by_count":59},{"id":"1809.02721","title":"Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP","created":"2018-09-08","cited_by_count":58},{"id":"1906.06298","title":"Augmenting Neural Networks with First-order Logic","created":"2019-06-14","cited_by_count":51},{"id":"2005.03597","title":"Efficient Exact Verification of Binarized Neural Networks","created":"2020-05-07","cited_by_count":33},{"id":"2202.09791","title":"Contextual Semantic Embeddings for Ontology Subsumption Prediction","created":"2022-02-20","cited_by_count":31},{"id":"1905.13462","title":"Neural Markov Logic Networks","created":"2019-05-31","cited_by_count":27},{"id":"1807.08709","title":"The Vadalog System: Datalog-based Reasoning for Knowledge Graphs","created":"2018-07-23","cited_by_count":25},{"id":"2003.09712","title":"Understanding the Power and Limitations of Teaching with Imperfect Knowledge","created":"2020-03-21","cited_by_count":23},{"id":"1606.08359","title":"Lifted Rule Injection for Relation Embeddings","created":"2016-06-27","cited_by_count":22},{"id":"1610.06264","title":"Foundations of Modern Query Languages for Graph Databases","created":"2016-10-20","cited_by_count":22},{"id":"1804.06763","title":"A General Account of Argumentation with Preferences","created":"2018-04-18","cited_by_count":21},{"id":"2008.06692","title":"How to build your own ASP-based system?!","created":"2020-08-15","cited_by_count":20},{"id":"1301.6479","title":"Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP","created":"2013-01-28","cited_by_count":15},{"id":"1904.02688","title":"Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting","created":"2019-04-04","cited_by_count":11},{"id":"1509.02012","title":"Bounded Situation Calculus Action Theories","created":"2015-09-07","cited_by_count":10},{"id":"2007.01610","title":"Logical Separability of Labeled Data Examples under Ontologies","created":"2020-07-03","cited_by_count":10},{"id":"2008.03526","title":"Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase Saving, Heuristics, and More","created":"2020-08-08","cited_by_count":10},{"id":"1807.00048","title":"Formal Specification and Verification of Autonomous Robotic Systems: A Survey","created":"2018-06-29","cited_by_count":9},{"id":"1402.0569","title":"Description Logic Knowledge and Action Bases","created":"2014-02-04","cited_by_count":8},{"id":"1808.00417","title":"Debugging Non-Ground ASP Programs: Technique and Graphical Tools","created":"2018-08-01","cited_by_count":8},{"id":"1908.07141","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","created":"2019-08-20","cited_by_count":8},{"id":"2210.03553","title":"Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?","created":"2022-10-07","cited_by_count":8},{"id":"2003.08298","title":"Axiom Pinpointing","created":"2020-03-18","cited_by_count":7},{"id":"2003.08598","title":"Train Scheduling with Hybrid Answer Set Programming","created":"2020-03-19","cited_by_count":7},{"id":"2004.01859","title":"Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces","created":"2020-04-04","cited_by_count":7},{"id":"2107.08252","title":"Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches","created":"2021-07-17","cited_by_count":7},{"id":"2112.01441","title":"A Review of SHACL: From Data Validation to Schema Reasoning for RDF Graphs","created":"2021-12-02","cited_by_count":7},{"id":"2007.04620","title":"Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard","created":"2020-07-09","cited_by_count":6},{"id":"2104.14789","title":"Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory","created":"2021-04-30","cited_by_count":6},{"id":"2108.04769","title":"On the Foundations of Grounding in Answer Set Programming","created":"2021-08-10","cited_by_count":6},{"id":"2008.03050","title":"A General Framework for Stable Roommates Problems using Answer Set Programming","created":"2020-08-07","cited_by_count":5},{"id":"2109.07195","title":"Target Languages (vs. Inductive Biases) for Learning to Act and Plan","created":"2021-09-15","cited_by_count":5},{"id":"2109.08662","title":"Aggregate Semantics for Propositional Answer Set Programs","created":"2021-09-17","cited_by_count":5},{"id":"2205.11590","title":"Forecasting Argumentation Frameworks","created":"2022-05-23","cited_by_count":5},{"id":"1804.07805","title":"Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey","created":"2018-04-20","cited_by_count":4},{"id":"2103.10507","title":"CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version)","created":"2021-03-18","cited_by_count":4},{"id":"2111.06806","title":"First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries","created":"2021-11-12","cited_by_count":4},{"id":"2203.09361","title":"Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)","created":"2022-03-17","cited_by_count":4},{"id":"2204.10176","title":"Probing Script Knowledge from Pre-Trained Models","created":"2022-04-16","cited_by_count":4},{"id":"2008.03496","title":"Human Robot Collaborative Assembly Planning: An Answer Set Programming Approach","created":"2020-08-08","cited_by_count":3},{"id":"1401.3902","title":"On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic","created":"2014-01-16","cited_by_count":2},{"id":"1908.10405","title":"Extending Description Logic EL++ with Linear Constraints on the Probability of Axioms","created":"2019-08-27","cited_by_count":2},{"id":"2108.03474","title":"Solution Enumeration by Optimality in Answer Set Programming","created":"2021-08-07","cited_by_count":2},{"id":"1604.05273","title":"Learning Possibilistic Logic Theories from Default Rules","created":"2016-04-18","cited_by_count":1},{"id":"2009.04978","title":"Defeasible reasoning in Description Logics: an overview on DL^N","created":"2020-09-10","cited_by_count":1}],"next_cursor":null}