|
|
|
|
|
Giacomo Bergami
Recent findings demonstrate how database technology enhances the computation of formal verification tasks expressible in linear time logic for finite traces (LTLf). Human-readable declarative languages also help the common practitioner to express tempora...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 12
In some previous publications, we investigated the properties of a special binary relation, which was sometimes called the equivalence relation at infinity. For a pair of finite languages, the equality of infinite iterations of these langu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ivan Kosyanenko,Roman Bolbakov
Pág. 53 - 59
In today's team-based software development, good commit messages - comments on changes made in natural language - are essential. The metric for evaluating a commit message is its relevance. A good commit message should not only describe the changes made,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 13 - 19
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pedro Cabalar, Jorge Fandinno, Torsten Schaub and Philipp Wanko
Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abderrahmane Maaradji, Hakim Hacid and Assia Soukane
Service-oriented computing has become a popular area of research, with a particular focus on service composition. There have been many developments in this field, such as new techniques for data engineering in service description languages, protocols for...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jesus Insuasti, Felipe Roa and Carlos Mario Zapata-Jaramillo
Pre-conceptual schemas are a straightforward way to represent knowledge using controlled language regardless of context. Despite the benefits of using pre-conceptual schemas by humans, they present challenges when interpreted by computers. We propose an ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 9
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semi-lattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Spec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 8
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semi-lattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Specifically, for s...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 9
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semilattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Specifically, for s...
ver más
|
|
|
|
|
|