Papers
Group Decision Diagram (GDD): A Compact Representation for Permutations
Takanori Maehara, Yuma Inoue
Less but Better: Generalization Enhancement of Ordinal Embedding via Distributional Margin
Ke Ma, Qianqian Xu, Zhiyong Yang et al.
SDRL: Interpretable and Data-Efficient Deep Reinforcement Learning Leveraging Symbolic Planning
Daoming Lyu, Fangkai Yang, Bo Liu et al.
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs
Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavičius
SAT-Based Explicit LTLf Satisfiability Checking
Jianwen Li, Kristin Y. Rozier, Geguang Pu et al.
Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings
Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
Multi-Context System for Optimization Problems
Tiep Le, Tran Cao Son, Enrico Pontelli
Representing and Learning Grammars in Answer Set Programming
Mark Law, Alessandra Russo, Elisa Bertino et al.
Combining Deep Learning and Qualitative Spatial Reasoning to Learn Complex Structures from Sparse Examples with Noise
Nikhil Krishnaswamy, Scott Friedman, James Pustejovsky
Ontology-Based Query Answering for Probabilistic Temporal Data
Patrick Koopmann
LENA: Locality-Expanded Neural Embedding for Knowledge Base Completion
Fanshuang Kong, Richong Zhang, Yongyi Mao et al.
Knowledge Refinement via Rule Selection
Phokion G. Kolaitis, Lucian Popa, Kun Qian
Minimum Intervention Cover of a Causal Graph
Saravanan Kandasamy, Arnab Bhattacharyya, Vasant G. Honavar
Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions
Xuanxiang Huang, Kehang Fang, Liangda Fang et al.
Modular Materialisation of Datalog Programs
Pan Hu, Boris Motik, Ian Horrocks
Partial Awareness
Joseph Y. Halpern, Evan Piermont
Forgetting in Modular Answer Set Programming
Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr et al.
A Sequential Set Generation Method for Predicting Set-Valued Outputs
Tian Gao, Jie Chen, Vijil Chenthamarakshan et al.
Counting Complexity for Reasoning in Abstract Argumentation
Johannes K. Fichte, Markus Hecher, Arne Meier
Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability
Liangda Fang, Kewen Wang, Zhe Wang et al.
Strong Equivalence for Epistemic Logic Programs Made Easy
Wolfgang Faber, Michael Morak, Stefan Woltran
Complexity of Abstract Argumentation under a Claim-Centric View
Wolfgang Dvořák, Stefan Woltran
On Structured Argumentation with Conditional Preferences
Phan Minh Dung, Phan Minh Thang, Tran Cao Son
Validation of Growing Knowledge Graphs by Abductive Text Evidences
Jianfeng Du, Jeff Z. Pan, Sylvia Wang et al.