Search

Your search keyword '"Constable, Robert L."' showing total 3 results
Start Over Author "Constable, Robert L." Language undetermined
3 results on '"Constable, Robert L."'

1. Verbalization of high-level formal proofs

Author

Holland-Minkley, Amanda M., Barzilay, Regina, and Constable, Robert L.

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Information technology, Computer science
Abstract

We propose a new approach to text generation from formal proofs that exploits the high-level and interactive features of a tactic-style theorem prover. The design of our system is based on communication conventions identified in a corpus of texts. We show how to use dialogue with the theorem prover to obtain information that is required for communication but is not explicitly used in reasoning.

Published
1999
Full Text
View/download PDF

3. Combining Epistemic Logic and Hennessy-Milner Logic

Author

Radu Mardare, Sophia Knight, Prakash Panangaden, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Aalborg University [Denmark] (AAU), Robert L. Constable and Alexandra Silva, ANR-09-BLAN-0169-01,PANDA,PANDA: PArallel aNd Distributed Analysis(2009), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-09-BLAN-0169,PANDA(2009), Constable, Robert L., and Silva, Alexandre

Subjects
0102 computer and information sciences, 01 natural sciences, dynamic logic, Epistemic modal logic, Computer Science::Logic in Computer Science, Calculus, 0101 mathematics, unfolding, Mathematics, Discrete mathematics, Predicate logic, epistemic logic, Modal logic, 010102 general mathematics, Computational logic, Multimodal logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 16. Peace & justice, Computer Science::Multiagent Systems, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Philosophy of logic, completeness, 010201 computation theory & mathematics, Many-valued logic, F.4.1, Dynamic logic (modal logic), Hennessy–Milner logic
Abstract

International audience; We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the current state and past history of the execution. This is in the spirit of dynamic epistemic logic but is a direct combination of Hennessy-Milner logic and epistemic logic. We give an axiomatization for the for the logic and prove a completeness theorem with respect to the class of models obtained by unfolding labelled transition systems.

Published
2012
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results