English
Related papers

Related papers: A Note on Reasoning on $\textit{DL-Lite}_{\cal R}$…

200 papers

In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology. To correctly compute answers to queries, it is necessary to perform complex reasoning over the constraints…

Databases · Computer Science 2022-08-17 Christian Alrabbaa , Stefan Borgwardt , Patrick Koopmann , Alisa Kovtunova

Datalog is a popular logic programming language for deductive reasoning tasks in a wide array of applications, including business analytics, program analysis, and ontological reasoning. However, Datalog's restriction to flat facts over…

Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like Machine-Learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation.…

Logic in Computer Science · Computer Science 2022-05-17 Matthias Lanzinger , Stefano Sferrazza , Georg Gottlob

Neural rationale models are popular for interpretable predictions of NLP tasks. In these, a selector extracts segments of the input text, called rationales, and passes these segments to a classifier for prediction. Since the rationale is…

Computation and Language · Computer Science 2022-07-26 Yiming Zheng , Serena Booth , Julie Shah , Yilun Zhou

LLM-generated explanations can make technical content more accessible, but there is a ceiling on what they can support interactively. Because LLM outputs are static text, they cannot be executed or stepped through. We argue that grounding…

Human-Computer Interaction · Computer Science 2026-04-13 Hita Kambhamettu , Will Crichton , Sean Welleck , Harrison Goldstein , Andrew Head

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…

Artificial Intelligence · Computer Science 2026-04-22 David Billington

Recent language models enable new opportunities for structured reasoning with text, such as the construction of intuitive, proof-like textual entailment trees without relying on brittle formal logic. However, progress in this direction has…

Existential rules form an expressive Datalog-based language to specify ontological knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the…

Computational Complexity · Computer Science 2023-07-25 Georg Gottlob , Marco Manna , Cinzia Marte

DatalogMTL is an extension of Datalog with operators from metric temporal logic which has received significant attention in recent years. It is a highly expressive knowledge representation language that is well-suited for applications in…

Artificial Intelligence · Computer Science 2022-01-13 Dingmin Wang , Pan Hu , Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

With the advent of larger and more complex deep learning models, such as in Natural Language Processing (NLP), model qualities like explainability and interpretability, albeit highly desirable, are becoming harder challenges to tackle and…

Computation and Language · Computer Science 2024-01-30 Amrita Bhattacharjee , Raha Moraffah , Joshua Garland , Huan Liu

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

In our experience, some ontology users find it much easier to convey logical statements using rules rather than OWL (or description logic) axioms. Based on recent theoretical developments on transformations between rules and description…

Artificial Intelligence · Computer Science 2018-08-31 Md. Kamruzzaman Sarker , David Carral , Adila A. Krisnadhi , Pascal Hitzler

In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…

Logic in Computer Science · Computer Science 2025-05-19 Laura Bozzelli , Tadeusz Litak , Munyque Mittelmann , Aniello Murano

The recent series of innovations in deep learning (DL) have shown enormous potential to impact individuals and society, both positively and negatively. The DL models utilizing massive computing power and enormous datasets have significantly…

Artificial Intelligence · Computer Science 2020-12-15 Manas Gaur , Keyur Faldu , Amit Sheth

Programming with logic for sophisticated applications must deal with recursion and negation, which together have created significant challenges in logic, leading to many different, conflicting semantics of rules. This paper describes a…

Logic in Computer Science · Computer Science 2021-10-07 Yanhong A. Liu , Scott D. Stoller

In this paper we address an issue that has been brought to the attention of the database community with the advent of the Semantic Web, i.e. the issue of how ontologies (and semantics conveyed by them) can help solving typical database…

Logic in Computer Science · Computer Science 2010-03-15 Francesca A. Lisi

Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox data). In this paper we look particularly at the case where both a set of positive and a…

Artificial Intelligence · Computer Science 2018-12-11 Md Kamruzzaman Sarker , Pascal Hitzler

Inductive reasoning is an essential capability for large language models (LLMs) to achieve higher intelligence, which requires the model to generalize rules from observed facts and then apply them to unseen examples. We present MIRAGE, a…

Computation and Language · Computer Science 2025-03-03 Jiachun Li , Pengfei Cao , Zhuoran Jin , Yubo Chen , Kang Liu , Jun Zhao

We study how large language models (LLMs) reason about memorized knowledge through simple binary relations such as equality ($=$), inequality ($<$), and inclusion ($\subset$). Unlike in-context reasoning, the axioms (e.g., $a < b, b < c$)…

Machine Learning · Computer Science 2025-09-18 Jonathan Shaki , Emanuele La Malfa , Michael Wooldridge , Sarit Kraus

Pretrained large Language Models (LLMs) are able to answer questions that are unlikely to have been encountered during training. However a diversity of potential applications exist in the broad domain of reasoning systems and considerations…

Computation and Language · Computer Science 2024-11-27 Tim Hartill
‹ Prev 1 8 9 10 Next ›