Zobrazeno 1 - 10
of 26
pro vyhledávání: '"George Koletsos"'
Publikováno v:
Innovations in Systems and Software Engineering. 13:51-66
Open standardization seems to be very popular among software developers as it simplifies the standard's adoption by the software engineering. Formal specification methods, while very promising, are being adopted slowly as the industry seems to have l
Autor:
George Koletsos
Publikováno v:
Fundamenta Informaticae. 121:185-202
We use the system of intersection types and the type assignment method to prove ter- mination properties in λ-calculus. In the first part we deal with conservation properties. We give a type assignment proof of the classical conservation theorem for
Publikováno v:
Fundamenta Informaticae. 38:281-324
A family of many-valued modal logics which correspond to possible-worlds models with many-valued accessibility relations, has been recently proposed by M. Fitting [7, 8]. Non-monotonic extensions of these logics are introduced with a fixpoint constru
Publikováno v:
The Computer Journal. :bxv120
Publikováno v:
2012 International Symposium on Innovations in Intelligent Systems and Applications.
Formal methods, while very promising, are being adopted by software/protocol engineers very slowly, as the industry has little motivation to move into this new, unknown territory. At the same time, new industrial standards are being released quite fr
Publikováno v:
Web Reasoning and Rule Systems ISBN: 9783642332029
RR
RR
Conjunctive query (CQ) answering is a key reasoning service for ontology-based data access. One of the most prominent approaches to conjunctive query answering is query rewriting where a wide variety of systems has been proposed the last years. All o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d76cb43886103888a6dcbfc45cdb5c01
https://doi.org/10.1007/978-3-642-33203-6_13
https://doi.org/10.1007/978-3-642-33203-6_13
Publikováno v:
2009 Fourth South-East European Workshop on Formal Methods.
Syntax Notation One (ASN.1) is a very popular specification language with many applications in networking. We work towards the correct translation from ASN.1, into the powerful algebraic specification language CafeOBJ. Our aim is to create a software
Autor:
George Koletsos, George Stavrinos
Publikováno v:
The Australasian Journal of Logic. 6
We give a proof via reducibility of the Church-Rosser property for the system D of λ-calculus with intersection types. As a consequence we can get the confluence property for developments directly, without making use of the strong normalization prop
Publikováno v:
International Journal of Reasoning-based Intelligent Systems. 2:300
The adoption of algebraic specification techniques by the networks' research community is happening slowly but steadily. We present a software environment that can translate a protocol's specification, from Abstract Syntax Notation One (ASN.1), into
Autor:
George Koletsos
Publikováno v:
Journal of Symbolic Logic. 50:791-805
Since the invention of β-logic by J. Y. Girard, a lot of work has been done concerning different aspects of this logic, β-completeness (classical and intuitionistic), interpolation theorems, and completeness of Lβω are some examples of this (see