English
Related papers

Related papers: On Termination of Transactions over Semantic Docum…

200 papers

Normative non-functional requirements specify constraints that a system must observe in order to avoid violations of social, legal, ethical, empathetic, and cultural norms. As these requirements are typically defined by non-technical system…

Formal semantics offers a complete and rigorous definition of a language. It is important to define different semantic models for a language and different models serve different purposes. Building equivalence between different semantic…

Logic in Computer Science · Computer Science 2010-02-18 Shamim H. Ripon , Michael Butler

Simulations offer opportunities in the examination of manufacturing processes. They represent various aspects of the production process and the associated production systems. However, often a single simulation does not suffice to provide a…

Software Engineering · Computer Science 2024-11-26 Jonathan Reif , Tom Jeleniewski , Aljosha Köcher , Tim Frerich , Felix Gehlhoff , Alexander Fay

We study the problem of finite ontology mediated query answering (FOMQA), the variant of OMQA where the represented world is assumed to be finite, and thus only finite models of the ontology are considered. We adopt the most typical setting…

Artificial Intelligence · Computer Science 2018-08-10 Tomasz Gogacz , Yazmin Ibáñez-García , Filip Murlak

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

Logic in Computer Science · Computer Science 2023-07-28 Fabian Mitterwallner , Aart Middeldorp , René Thiemann

Service robots are complex, heterogeneous, software intensive systems built from components. Recent robotics research trends mainly address isolated capabilities on functional level. Non-functional properties, such as responsiveness or…

Robotics · Computer Science 2016-01-12 Alex Lotz , Arne Hamann , Ingo Lütkebohle , Dennis Stampfer , Matthias Lutz , Christian Schlegel

This book explores an alternative to the current dominant paradigm where a discrete computer model is constructed as an attempt to approximate some continuum theory. We focus on a class of discrete computer models that are based on simple…

Logic in Computer Science · Computer Science 2017-04-14 Garry Pantelis

Word embeddings are substantially successful in capturing semantic relations among words. However, these lexical semantics are difficult to be interpreted. Definition modeling provides a more intuitive way to evaluate embeddings by…

Computation and Language · Computer Science 2020-07-21 Haitong Zhang , Yongping Du , Jiaxin Sun , Qingxiao Li

Extracting conceptual models, e.g., entity relationship model or Business Process model, from software requirement document is an essential task in the software development life cycle. Business process model presents a clear picture of…

Software Engineering · Computer Science 2020-08-07 Muhammad Javed , Yuqing Lin

This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…

Logic in Computer Science · Computer Science 2019-12-19 Ambroise Lafont

We show how systems of session types can enforce interactions to be bounded for all typable processes. The type system we propose is based on Lafont's soft linear logic and is strongly inspired by recent works about session types as…

Logic in Computer Science · Computer Science 2011-08-24 Ugo Dal Lago , Paolo Di Giamberardino

Humans engage in informal debates on a daily basis. By expressing their opinions and ideas in an argumentative fashion, they are able to gain a deeper understanding of a given problem and in some cases, find the best possible course of…

Logic in Computer Science · Computer Science 2019-12-13 Ria Jha , Francesco Belardinelli , Francesca Toni

In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max…

Databases · Computer Science 2007-05-23 Sergio Flesca , Sergio Greco

We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh automata on infinite words. We consider the deterministic as…

Formal Languages and Automata Theory · Computer Science 2025-11-12 Mario Grobler , Leif Sabellek , Sebastian Siebertz

Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Henning Bordihn , Martin Kutrib , Andreas Malcher

Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…

Logic in Computer Science · Computer Science 2025-10-01 Luke Bayzid , Alexandre Madeira , Manuel A. Martins

Models are heavily used in software engineering and together with their systems they evolve over time. Thus, managing their changes is an important challenge for system maintainability. Existing approaches to model differencing concentrate…

Software Engineering · Computer Science 2014-09-10 Shahar Maoz , Jan Oliver Ringert , Bernhard Rumpe

This note clarifies the concept of syntax and semantics and their relationships. Today, a lot of confusion arises from the fact that the word "semantics" is used in different meanings. We discuss a general approach at defining semantics…

Software Engineering · Computer Science 2014-09-25 Bernhard Rumpe

We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

The paper provides a survey of semantic methods for solution of fundamental tasks in mathematical knowledge management. Ontological models and formalisms are discussed. We propose an ontology of mathematical knowledge, covering a wide range…

Artificial Intelligence · Computer Science 2014-09-01 Alexander Elizarov , Alexander Kirillovich , Evgeny Lipachev , Olga Nevzorova , Valery Solovyev , Nikita Zhiltsov
‹ Prev 1 3 4 5 6 7 10 Next ›