English
Related papers

Related papers: Rational Dialogues

200 papers

This paper explains why scripted dialogue shares some crucial properties with discourse. In particular, when scripted dialogues are generated by a Natural Language Generation system, the generator can apply revision strategies that cannot…

Computation and Language · Computer Science 2007-05-23 Paul Piwek , Kees van Deemter

Drawing appropriate defeasible inferences has been proven to be one of the most pervasive puzzles of natural language processing and a recurrent problem in pragmatics. This paper provides a theoretical framework, called ``stratified…

cmp-lg · Computer Science 2008-02-03 Daniel Marcu , Graeme Hirst

Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…

Formal Languages and Automata Theory · Computer Science 2015-04-16 Ismaël Jecker , Emmanuel Filiot

A limit of rational varieties need not be rational, even if all varieties in the family are projective and have at most terminal singularities.

Algebraic Geometry · Mathematics 2015-08-06 Burt Totaro

Argumentation generation has attracted substantial research interest due to its central role in human reasoning and decision-making. However, most existing argumentative corpora focus on non-interactive, single-turn settings, either…

Computation and Language · Computer Science 2026-01-13 Yongkang Liu , Jiayang Yu , Mingyang Wang , Yiqun Zhang , Ercong Nie , Shi Feng , Daling Wang , Kaisong Song , Hinrich Schütze

Human dialogues are scenario-based and appropriate responses generally relate to the latent context knowledge entailed by the specific scenario. To enable responses that are more meaningful and context-specific, we propose to improve…

Computation and Language · Computer Science 2020-10-07 Shaoxiong Feng , Xuancheng Ren , Hongshen Chen , Bin Sun , Kan Li , Xu Sun

We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this…

Formal Languages and Automata Theory · Computer Science 2013-06-07 Benjamin Steinberg

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

Logic in Computer Science · Computer Science 2012-04-16 Mnacho Echenim , Nicolas Peltier

We present infinite extensive strategy profiles with perfect information and we show that replacing finite by infinite changes the notions and the reasoning tools. The presentation uses a formalism recently developed by logicians and…

Computer Science and Game Theory · Computer Science 2015-12-23 Pierre Lescanne

We provide various counter-examples to the long-standing so-called "Omnibus Conjecture" in Rational Homotopy Theory. That is, we show that a space with finite dimensional even-degree rational cohomology and finite dimensional spherical…

Algebraic Topology · Mathematics 2020-11-04 Manuel Amann

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.

Group Theory · Mathematics 2012-07-05 Martha Giannoudovardi

The author describes a conceptual study towards mapping grounded natural language discourse representation structures to instances of controlled language statements. This can be achieved via a pipeline of preexisting state of the art…

Computation and Language · Computer Science 2013-12-10 Nicholas H. Kirk

Strategic reasoning enables agents to cooperate, communicate, and compete with other agents in diverse situations. Existing approaches to solving strategic games rely on extensive training, yielding strategies that do not generalize to new…

Artificial Intelligence · Computer Science 2023-05-31 Kanishk Gandhi , Dorsa Sadigh , Noah D. Goodman

Fact-based dialogue generation is a task of generating a human-like response based on both dialogue context and factual texts. Various methods were proposed to focus on generating informative words that contain facts effectively. However,…

Computation and Language · Computer Science 2020-05-11 Ryota Tanaka , Akinobu Lee

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

Logic in Computer Science · Computer Science 2025-11-14 Kenji Tokuo

We present a novel framework designed to extend model reconciliation approaches, commonly used in human-aware planning, for enhanced human-AI interaction. By adopting a structured argumentation-based dialogue paradigm, our framework enables…

Artificial Intelligence · Computer Science 2024-08-09 Stylianos Loukas Vasileiou , Ashwin Kumar , William Yeoh , Tran Cao Son , Francesca Toni

A discourse strategy is a strategy for communicating with another agent. Designing effective dialogue systems requires designing agents that can choose among discourse strategies. We claim that the design of effective strategies must take…

cmp-lg · Computer Science 2016-08-31 Marilyn A. Walker

Rationality has been an intriguing topic for several decades. Even the scope of definition of rationality across different subjects varies. Several theories (e.g., game theory) initially evolved on the basis that agents (e.g., humans) are…

Computers and Society · Computer Science 2022-04-28 Dibakar Das

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter
‹ Prev 1 4 5 6 7 8 10 Next ›