Sciweavers

827 search results - page 24 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
KR
2004
Springer
14 years 1 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
ICCS
2007
Springer
13 years 11 months ago
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...
Jean-François Baget
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
13 years 11 months ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
JAR
2008
98views more  JAR 2008»
13 years 7 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
LOGCOM
2006
105views more  LOGCOM 2006»
13 years 7 months ago
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone