English
Related papers

Related papers: Reasoning about Action: An Argumentation - Theoret…

200 papers

We present a method to solve planning problems involving sequential decision making in unpredictable environments while accomplishing a high level task specification expressed using the formalism of linear temporal logic. Our method…

Robotics · Computer Science 2015-06-16 Seyedshams Feyzabadi , Stefano Carpin

Argumentation is one of the most popular approaches of defining a~non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict…

Artificial Intelligence · Computer Science 2014-04-29 Jozef Frtús

In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the operational behaviour of some typed terms.

Logic · Mathematics 2009-05-12 Karim Nour , Khelifa Saber

Large language models have demonstrated strong reasoning capabilities in general knowledge question answering. However, their ability to handle temporal information remains limited. To address this limitation, existing approaches often…

Computation and Language · Computer Science 2026-04-28 Yimin Deng , Yejing Wang , Zhenxi Lin , Zichuan Fu , Guoshuai Zhao , Derong Xu , Yefeng Zheng , Xiangyu Zhao , Xian Wu , Li Zhu , Xueming Qian

Prediction without justification has limited applicability. As a remedy, we learn to extract pieces of input text as justifications -- rationales -- that are tailored to be short and coherent, yet sufficient for making the same prediction.…

Computation and Language · Computer Science 2016-11-04 Tao Lei , Regina Barzilay , Tommi Jaakkola

Solving multiagent problems can be an uphill task due to uncertainty in the environment, partial observability, and scalability of the problem at hand. Especially in an urban setting, there are more challenges since we also need to maintain…

Artificial Intelligence · Computer Science 2020-11-11 Jiajing Ling , Kushagra Chandak , Akshat Kumar

The use of logical systems for problem-solving may be as diverse as in proving theorems in mathematics or in figuring out how to meet up with a friend. In either case, the problem solving activity is captured by the search for an…

Logic in Computer Science · Computer Science 2023-03-28 Alexander V. Gheorghiu , David J. Pym

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies.…

Computer Science and Game Theory · Computer Science 2010-06-28 Jonathan A. Zvesper , Krzysztof R. Apt

Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive conclusions. For instance, Aristotle's famous "Sea Battle…

Logic in Computer Science · Computer Science 2024-05-28 Fengkui Ju , Gianluca Grilletti , Valentin Goranko

Reasoning about the causes behind observations is crucial to the formalization of rationality. While extensive research has been conducted on root cause analysis, most studies have predominantly focused on deterministic settings. In this…

Artificial Intelligence · Computer Science 2024-12-24 Shakil M. Khan , Yves Lespérance , Maryam Rostamigiv

Analyzing decision problems under uncertainty commonly relies on idealizing assumptions about the describability of the world, with the most prominent examples being the closed world and the small world assumption. Most assumptions are…

Methodology · Statistics 2025-12-08 Christoph Jansen , Georg Schollmeyer , Thomas Augustin , Julian Rodemann

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior…

Computer Science and Game Theory · Computer Science 2013-08-19 Kevin Waugh , Brian D. Ziebart , J. Andrew Bagnell

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

We study MinMax solution methods for a general class of optimization problems related to (and including) optimal transport. Theoretically, the focus is on fitting a large class of problems into a single MinMax framework and generalizing…

Optimization and Control · Mathematics 2020-10-23 Luca De Gennaro Aquino , Stephan Eckstein

In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional…

Artificial Intelligence · Computer Science 2011-10-18 Laura Giordano , Alberto Martelli , Daniele Theseider Dupré

Optimization is offered as an objective approach to resolving complex, real-world decisions involving uncertainty and conflicting interests. It drives business strategies as well as public policies and, increasingly, lies at the heart of…

Artificial Intelligence · Computer Science 2023-08-01 Benjamin Laufer , Thomas Krendl Gilbert , Helen Nissenbaum

I show that propositional intuitionistic logic is complete with respect to an adaptation of Dummett's pragmatist justification procedure. In particular, given a pragmatist justification of an argument, I show how to obtain a natural…

Logic · Mathematics 2019-03-19 Hermógenes Oliveira

Task and motion planning represents a powerful set of hybrid planning methods that combine reasoning over discrete task domains and continuous motion generation. Traditional reasoning necessitates task domain models and enough information…

Robotics · Computer Science 2024-06-14 Tianyang Pan , Rahul Shome , Lydia E. Kavraki

We consider modeling the conception of knowledge in terms of temporal logic. The study of knowledge logical operations is originated around 1962 by representation of knowledge and belief using modalities. Nowadays, it is very good…

Logic in Computer Science · Computer Science 2014-05-06 Vladimir Rybakov