Sciweavers

366 search results - page 61 / 74
» Reasoning about relational granulation in modal logics
Sort
View
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 6 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg
COMMA
2006
15 years 1 months ago
Justifying Actions by Accruing Arguments
This paper offers a logical formalisation of an argument-based account of reasoning about action, taking seriously the abductive nature of this form of reasoning. The particular qu...
Trevor J. M. Bench-Capon, Henry Prakken
AGP
1994
IEEE
15 years 3 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
LATA
2009
Springer
15 years 6 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
PPDP
2007
Springer
15 years 5 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty