Sciweavers

4595 search results - page 353 / 919
» Reasoning about Plans
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
15 years 7 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
FMSD
2006
77views more  FMSD 2006»
15 years 7 months ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
JUCS
2010
114views more  JUCS 2010»
15 years 6 months ago
Deontic Logic-based Framework for Ontology Aligment in Agent Communities
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...
Grzegorz Kolaczek, Krzysztof Juszczyszyn
JUCS
2010
114views more  JUCS 2010»
15 years 6 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 5 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent