English
Related papers

Related papers: A Dynamic Epistemic Framework for Conformant Plann…

200 papers

Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all…

Artificial Intelligence · Computer Science 2021-07-01 Pedro Cabalar , Jorge Fandinno , Luis Fariñas del Cerro

When a machine learning model is deployed, its predictions can alter its environment, as better informed agents strategize to suit their own interests. With such alterations in mind, existing approaches to uncertainty quantification break.…

Machine Learning · Statistics 2024-11-05 Daniel Csillag , Claudio José Struchiner , Guilherme Tegoni Goedert

The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communication, and the nature of failures that processes can suffer. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-04-27 Eric Goubault , Sergio Rajsbaum

We propose a framework for planning in unknown dynamic environments with probabilistic safety guarantees using conformal prediction. Particularly, we design a model predictive controller (MPC) that uses i) trajectory predictions of the…

Robotics · Computer Science 2023-06-09 Lars Lindemann , Matthew Cleaveland , Gihyun Shim , George J. Pappas

Dynamic epistemic logic (DEL) is a logical framework for representing and reasoning about knowledge change for multiple agents. An important computational task in this framework is the model checking problem, which has been shown to be…

Computational Complexity · Computer Science 2020-09-21 Ronald de Haan , Iris van de Pol

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets,…

Logic in Computer Science · Computer Science 2020-02-19 Kyle Marple , Gopal Gupta

An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…

Artificial Intelligence · Computer Science 2009-09-25 S. Bhansali , G. A. Kramer , T. J. Hoar

We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and tests makes its proof-theory rather difficult. We develop a…

Logic in Computer Science · Computer Science 2016-09-15 Florian Bruse , Daniel Kernberger , Martin Lange

Language models have been shown to perform remarkably well on a wide range of natural language processing tasks. In this paper, we propose LEAP, a novel system that uses language models to perform multi-step logical reasoning and…

Computation and Language · Computer Science 2023-11-08 Hongyu Zhao , Kangrui Wang , Mo Yu , Hongyuan Mei

Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts cannot guarantee completeness, often they are able to…

Artificial Intelligence · Computer Science 2011-04-28 Tuan Nguyen , Subbarao Kambhampati , Minh Do

Conformal prediction methods create prediction bands with distribution-free guarantees but do not explicitly capture epistemic uncertainty, which can lead to overconfident predictions in data-sparse regions. Although recent conformal scores…

Machine Learning · Statistics 2025-06-11 Luben M. C. Cabezas , Vagner S. Santos , Thiago R. Ramos , Rafael Izbicki

We show that the model-checking problem is decidable for a fragment of the epistemic \mu-calculus. The fragment allows free variables within the scope of epistemic modalities in a restricted form that avoids constructing formulas embodying…

Logic in Computer Science · Computer Science 2012-07-17 Rodica Bozianu , Cătălin Dima , Constantin Enea

We describe a task and motion planning architecture for highly dynamic systems that combines a domain-independent sampling-based deliberative planning algorithm with a global reactive planner. We leverage the recent development of a…

Planning remains a core challenge for large language models (LLMs), particularly in domains that require coherent multi-step action sequences grounded in external constraints. We introduce SymPlanner, a novel framework that equips LLMs with…

Computation and Language · Computer Science 2025-10-07 Siheng Xiong , Zhangding Liu , Jieyu Zhou , Yusen Su

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.…

Logic in Computer Science · Computer Science 2023-06-22 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

Robots executing iterative tasks in complex, uncertain environments require control strategies that balance robustness, safety, and high performance. This paper introduces a safe information-theoretic learning model predictive control…

Enhancing the reasoning capabilities of language models (LMs) remains a key challenge, especially for tasks that require complex, multi-step decision-making where existing Chain-of-Thought (CoT) approaches struggle with consistency and…

Computation and Language · Computer Science 2025-08-21 Siheng Xiong , Ali Payani , Yuan Yang , Faramarz Fekri

Large language model (LLM) based task plans and corresponding human demonstrations for embodied AI may be noisy, with unnecessary actions, redundant navigation, and logical errors that reduce policy quality. We propose an iterative…

Artificial Intelligence · Computer Science 2026-01-01 Ananth Hariharan , Vardhan Dongre , Dilek Hakkani-Tür , Gokhan Tur

Business processes need to have certain constraints such that they can lead to sustainable outcomes. These constraints can be manifold and their adherence has to be monitored. In the past compliance checking has been applied in several…

Computers and Society · Computer Science 2020-06-19 Clemens Schreiber