Computability theory, semantics and logic programming
نویسندگان
چکیده
منابع مشابه
Logic programming : operational semantics and proof theory
Downloading the book in this website lists can give you more advantages. It will show you the best book collections and completed collections. So many books can be found in this website. So, this is not only this logic programming operational semantics and proof theory. However, this book is referred to read because it is an inspiring book to give you more chance to get experiences and also tho...
متن کاملOn abstract resource semantics and computability logic
We show that the uniform validity is equivalent to the non-uniform validity for Blass’ semantics of [A game semantics for linear logic. Annals of Pure and Applied Logic 56 (1992) 183–220]. We present a shorter proof (than that of [G. Japaridze. The intuitionistic fragment of computability logic at the propositional level. Annals of Pure and Applied Logic 147 (2007), No.3, pp.187-227]) of the co...
متن کاملInherently Reversible Grammars, Logic Programming And Computability
This paper a t tempts to clarify two distinct notions of "reversibility": (i) Uniformity of implementation of parsing and generation, and (it) reversibility as an inherent (or intrinsic) property of grammars. On the one hand, we explain why grammars specified as definite programs (or the various related "unification grammars") lead to uniformity of implementation. On the other hand, we define d...
متن کاملComputability Logic: a formal theory of interaction
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic (CL) is a formal theory of computability — in particular, a theory of interactive computability. It understands computational problems as games played by a machine against the environment, their computability as existence of a machine that always wins the game, logical op...
متن کاملSuitable semantics for Logic Programming
In this paper we introduce the notion of a suitable semantics which is very similar to the notion of a well behaved semantics. While well-behaved semantics ask for the relevance property, suitable semantics ask for ratio-nality. We argue that suitable semantics can be more appropiated than well-behaved semantics in some cases. We also introduce CSC, which is a suitable semantics deened via a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1988
ISSN: 0167-6423
DOI: 10.1016/0167-6423(88)90069-x