English
Related papers

Related papers: The DIAMOND System for Argumentation: Preliminary …

200 papers

We introduce Diddy, a collection of Python scripts for analyzing infinite discrete dynamical systems. The main focus is on generalized multidimensional shifts of finite type (SFTs). We show how Diddy can be used to easily define SFTs and…

Mathematical Software · Computer Science 2023-05-03 Ville Salo , Ilkka Törmä

Autoformalization addresses the scarcity of data for Automated Theorem Proving (ATP) by translating mathematical problems from natural language into formal statements. Efforts in recent work shift from directly prompting large language…

Artificial Intelligence · Computer Science 2025-10-09 Qi Guo , Jianing Wang , Jianfei Zhang , Deyang Kong , Xiangzhou Huang , Xiangyu Xi , Wei Wang , Jingang Wang , Xunliang Cai , Shikun Zhang , Wei Ye

Logic has proved essential for formally modeling software based systems. Such formal descriptions, frequently called specifications, have served not only as requirements documentation and formalisation, but also for providing the…

Logic in Computer Science · Computer Science 2021-07-20 Carlos G. Lopez Pombo , Thomas S. E. Maibaum

The act of persuasion, a key component in rhetoric argumentation, may be viewed as a dynamics modifier. We extend Dung's frameworks with acts of persuasion among agents, and consider interactions among attack, persuasion and defence that…

Artificial Intelligence · Computer Science 2018-11-08 Ryuta Arisaka , Ken Satoh

This paper presents a hybrid methodology that enhances the training process of deep learning (DL) models by embedding domain expert knowledge using ontologies and answer set programming (ASP). By integrating these symbolic AI methods, we…

Artificial Intelligence · Computer Science 2025-06-10 Fadi Al Machot , Martin Thomas Horsch , Habib Ullah

The traditional abstract domain framework for imperative programs suffers from several shortcomings; in particular it does not allow precise symbolic abstractions. To solve these problems, we propose a new abstract interpretation framework,…

Software Engineering · Computer Science 2018-01-01 Matthieu Lemerre , Sébastien Bardin

We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications. Starting from…

Artificial Intelligence · Computer Science 2020-02-20 Pedro Cabalar , Martín Diéguez , Torsten Schaub , François Laferrière

On the Semantic Web, metadata and ontologies are used to enable computers to read data. The Web Ontology Language (OWL) has been proposed as a standard ontological language, and various inference systems for this language have been studied.…

Logic in Computer Science · Computer Science 2022-08-11 Daiki Takahashi , Ken Kaneiwa

We introduce a novel architecture and computational framework for formal, automated analysis of systems with a broad set of nonlinearities in the feedback loop, such as neural networks, vision controllers, switched systems, and even simple…

Optimization and Control · Mathematics 2018-05-02 Ivan Papusha , Ufuk Topcu , Steven Carr , Niklas Lauffer

A framework with sets of attacking arguments (SETAF) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from Normal Logic…

Artificial Intelligence · Computer Science 2024-07-09 João Alcântara , Renan Cordeiro , Samy Sá

The differentiable implementation of logic yields a seamless combination of symbolic reasoning and deep neural networks. Recent research, which has developed a differentiable framework to learn logic programs from examples, can even acquire…

Artificial Intelligence · Computer Science 2021-03-03 Hikaru Shindo , Masaaki Nishino , Akihiro Yamamoto

This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract representation of these constraint atoms in which a constraint atom is represented…

Artificial Intelligence · Computer Science 2009-05-01 Yi-Dong Shen , Jia-Huai You , Li-Yan Yuan

Decision tree models, including random forests and gradient-boosted decision trees, are widely used in machine learning due to their high predictive performance. However, their complex structures often make them difficult to interpret,…

Artificial Intelligence · Computer Science 2026-01-08 Akihiro Takemura , Masayuki Otani , Katsumi Inoue

Dialogue system (DS) attracts great attention from industry and academia because of its wide application prospects. Researchers usually divide the DS according to the function. However, many conversations require the DS to switch between…

Computation and Language · Computer Science 2020-04-30 Longxuan Ma , Wei-Nan Zhang , Mingda Li , Ting Liu

We recently presented the so-called allagmatic method, which includes a system metamodel providing a framework for describing, modelling, simulating, and interpreting complex systems. Its development and programming was guided by…

Neural and Evolutionary Computing · Computer Science 2022-08-01 Patrik Christen , Olivier Del Fabbro

Typically available dialogue frameworks have adopted a semantic representation based on dialogue-acts and slot-value pairs. Despite its simplicity, this representation has disadvantages such as the lack of expressivity, scalability and…

Computation and Language · Computer Science 2024-01-09 Morgan Veyret , Jean-Baptiste Duchene , Kekeli Afonouvi , Quentin Brabant , Gwenole Lecorve , Lina M. Rojas-Barahona

For widespread deployment in domains characterized by partial observability, non-deterministic actions and unforeseen changes, robots need to adapt sensing, processing and interaction with humans to the tasks at hand. While robots typically…

Artificial Intelligence · Computer Science 2013-08-05 Shiqi Zhang , Mohan Sridharan

Effective field theories (EFTs) are widely considered by physicists to be explanatory and to be the appropriate frameworks for modelling various phenomena at different scales. At the same time, they are known to be approximate, restricted,…

History and Philosophy of Physics · Physics 2025-07-08 Martin King

Diagram question answering (Diagram QA) requires reasoning-level attribution that links each question-answer pair to all visual regions needed to derive the answer, rather than only the region containing the final response. Creating such…

Deep Feedback Models (DFMs) are a new class of stateful neural networks that combine bottom up input with high level representations over time. This feedback mechanism introduces dynamics into otherwise static architectures, enabling DFMs…

Computer Vision and Pattern Recognition · Computer Science 2025-09-22 David Calhas , Arlindo L. Oliveira
‹ Prev 1 8 9 10 Next ›