Sciweavers

3658 search results - page 234 / 732
» The logic of proofs, semantically
Sort
View
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
CHARME
2003
Springer
100views Hardware» more  CHARME 2003»
15 years 12 months ago
Inductive Assertions and Operational Semantics
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
J. Strother Moore
ENTCS
2008
106views more  ENTCS 2008»
15 years 6 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer
LICS
2006
IEEE
16 years 21 days ago
Independence and Concurrent Separation Logic
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
Jonathan Hayman, Glynn Winskel
IJIS
2011
83views more  IJIS 2011»
14 years 10 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide