Results 1 
8 of
8
Modality in Dialogue: Planning, Pragmatics and Computation
, 1998
"... Natural language generation (NLG) is first and foremost a reasoning task. In this reasoning, a system plans a communicative act that will signal key facts about the domain to the hearer. In generating action descriptions, this reasoning draws on characterizations both of the causal properties of the ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
Natural language generation (NLG) is first and foremost a reasoning task. In this reasoning, a system plans a communicative act that will signal key facts about the domain to the hearer. In generating action descriptions, this reasoning draws on characterizations both of the causal properties of the domain and the states of knowledge of the participants in the conversation. This dissertation shows how such characterizations can be specified declaratively and accessed efficiently in NLG. The heart of this dissertation is a study of logical statements about knowledge and action in modal logic. By investigating the prooftheory of modal logic from a logic programming point of view, I show how many kinds of modal statements can be seen as straightforward instructions for computationally manageable search, just as Prolog clauses can. These modal statements provide sufficient expressive resources for an NLG system to represent the effects of actions in the world or to model an addressee whose knowledge in some respects exceeds and in other respects falls short of its own. To illustrate the use of such statements, I describe how the SPUD sentence planner exploits a modal knowledge base to
Connectionbased Theorem Proving in Classical and Nonclassical Logics
 Journal of Universal Computer Science
, 1999
"... Abstract: We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic ..."
Abstract

Cited by 24 (15 self)
 Add to MetaCart
(Show Context)
Abstract: We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development of proofs in interactive proof assistants and shows how to integrate automated and interactive theorem proving. 1
Solving equations with sequence variables and sequence functions
 J. Symbolic Computation
, 2007
"... Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variable can be instantiated by any finite sequence of terms. A sequence function abbreviates a finite sequence of functions all ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
(Show Context)
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variable can be instantiated by any finite sequence of terms. A sequence function abbreviates a finite sequence of functions all having the same argument lists. It is proved that solvability of systems of equations of this form is decidable. A new unification procedure that enumerates a complete almost minimal set of solutions is presented, together with variations for special cases. The procedure terminates if the solution set is finite. Applications in various areas of artificial intelligence, symbolic computation, and programming are discussed. 1
Solving Equations Involving Sequence Variables and Sequence Functions
 Artificial Intelligence and Symbolic Computation. Proc. of AISC’04 Conference, volume 3249 of LNAI
, 2004
"... Term equations involving individual and sequence variables, and individual and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A new unification procedure for solving such equations is presented. Decidability of unification is proved. Completeness and ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
(Show Context)
Term equations involving individual and sequence variables, and individual and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A new unification procedure for solving such equations is presented. Decidability of unification is proved. Completeness and almost minimality of the procedure is shown. 1
Flat matching
 Journal of Symbolic Computation
"... We study matching in flat theories both from theoretical and practical points of view. A flat theory is defined by the axiom f(x, f(y), z). = f(x, y, z) that indicates that nested occurrences of the function symbol f can be flattened out. From the theoretical side, we design a procedure to solve a s ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
We study matching in flat theories both from theoretical and practical points of view. A flat theory is defined by the axiom f(x, f(y), z). = f(x, y, z) that indicates that nested occurrences of the function symbol f can be flattened out. From the theoretical side, we design a procedure to solve a system of flat matching equations and prove its soundness, completeness, and minimality. The minimal complete set of matchers for such a system can be infinite. The procedure enumerates this set and stops if it is finite. We identify a class of problems on which the procedure stops. From the practical point of view, we look into restrictions of the procedure that give an incomplete terminating algorithm. From this perspective, we give a set of rules that, in our opinion, describes the precise semantics for the flat matching algorithm implemented in the Mathematica system. 1.
Disjunction and Modular Goaldirected Proof Search
"... This paper explores goaldirected proof search in firstorder multimodal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be considered independently, modular disjunctions in particular can b ..."
Abstract
 Add to MetaCart
This paper explores goaldirected proof search in firstorder multimodal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be considered independently, modular disjunctions in particular can be used to construct efficiently executable specifications in reasoning tasks involving partial information that otherwise might require prohibitive search. To achieve this behavior requires prior prooftheoretic justifications of logic programming to be extended, strengthened, and combined with prooftheoretic analyses of modal deduction in a novel way
Unification Procedure for Terms with Sequence Variables and Sequence Functions (Extended Abstract)
"... Temur Kutsia 1# and Mircea Marin Research Institute for Symbolic Computation, Johannes Kepler University Linz, kutsia@risc.unilinz.ac.at Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Mircea.Marin@oeaw.ac.at 1 ..."
Abstract
 Add to MetaCart
(Show Context)
Temur Kutsia 1# and Mircea Marin Research Institute for Symbolic Computation, Johannes Kepler University Linz, kutsia@risc.unilinz.ac.at Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Mircea.Marin@oeaw.ac.at 1