Sciweavers

181 search results - page 16 / 37
» On the Completeness of Propositional Hoare Logic
Sort
View
ICCD
2004
IEEE
137views Hardware» more  ICCD 2004»
15 years 6 months ago
Comparative Study of Strategies for Formal Verification of High-Level Processors
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
Miroslav N. Velev
LOGCOM
2002
85views more  LOGCOM 2002»
14 years 9 months ago
Fibring Labelled Deduction Systems
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
João Rasga, Amílcar Sernadas, Cristi...
AI
2008
Springer
14 years 9 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
76
Voted
ATAL
2006
Springer
15 years 1 months ago
Reasoning about action and cooperation
We present a logic for reasoning both about the ability of agents to cooperate to execute complex actions, and how this relates to their ability to reach certain states of affairs...
Luigi Sauro, Jelle Gerbrandy, Wiebe van der Hoek, ...
TABLEAUX
2009
Springer
15 years 4 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky