Increasing number of in-vehicle sensors, actuators and controllers involved in novel applications such as autonomous driving, requires new communication technologies to fulfill heterogeneous non-functional requirement...
详细信息
ISBN:
(纸本)9781509051984
Increasing number of in-vehicle sensors, actuators and controllers involved in novel applications such as autonomous driving, requires new communication technologies to fulfill heterogeneous non-functional requirements such as latency, bandwidth and reliability. Time-Sensitive Networking (TSN) is a set of new standards in development by Institute of Electrical and Electronics Engineers (IEEE) defined to support mixed criticality based on Ethernet technology. This technology has recently raised significant attention of automotive domain. However, the mutual influence of application requirements in relation to TSN standards still remains a complex problem to master. For instance, considering an existing complex automotive network, an engineer has to carefully analyze the possible effects of adding new sensors on other existing critical applications. The network has to be configured such that the fulfilling of all requirements is verified. Targeting this problem, a modeling approach based on logic programming (LP) is developed to support more efficient configuration and verification process with focus on in-vehicle TSN networks.
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is...
详细信息
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs as coalgebrae on presheaves. Then, we make explicit the underlying algebraic structure by using bialgebrae on presheaves. The resulting semantics turns out to be compositional with respect to conjunction and term substitution. Also, it encodes a parallel model of computation, whose soundness is guaranteed by a built-in notion of synchronisation between different threads.
This study was performed to extract rules for reducing body fat mass so as to prevent lifestyle-related diseases. Lifestyle-related diseases have been increasing in Japan, even among younger people. Body fat mass is r...
详细信息
ISBN:
(纸本)9781509038473
This study was performed to extract rules for reducing body fat mass so as to prevent lifestyle-related diseases. Lifestyle-related diseases have been increasing in Japan, even among younger people. Body fat mass is related to lifestyle-related diseases. Hence, finding rules for reducing body fat mass is very meaningful. We obtained lifestyle time-series data on five male subjects who are in their 20s and not obese. The data includes the amount of body fat mass of each subject and a variety of features such as sleep, exercise, and nutrient intake. We used Inductive logic programming (ILP) to apply this data because ILP can more flexibly learn rules than other machine-learning methods. As a result of applying the data to ILP, our ILP system successfully extracted rules of time-oriented relationships of nutrients to decrease body fat mass based on limited data. Intake of various nutrients one day and two days prior was effective in reducing body fat mass. Moreover, we determined that nutrients related to losing body fat mass include vitamin B2, pantothenic acid, fat, vitamin B1, and biotin.
This paper develops a logic programming language, GI-log, that extends answer set programming language with a new graded modality Kω where ω ⊆ [0, 1]. The modality is used to precede a literal in rules bodies, and t...
详细信息
We motivate and compare Agent-Oriented logic programming languages (AOLPs), showing that they are not really a departure from the basic logic programming paradigm, but rather constitute an extension to account for abs...
详细信息
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic programs with generalized atoms or similar constructs. While the syntactic similarity is easy to see, also a strong rela...
详细信息
ISBN:
(纸本)9781577357384
This paper relates two extensively studied formalisms: abstract dialectical frameworks and logic programs with generalized atoms or similar constructs. While the syntactic similarity is easy to see, also a strong relation between various stable model semantics proposed for these formalisms is shown by means of a unifying framework in which these semantics are restated in terms of program reducts and an immediate consequence operator, where program reducts have only minimal differences. This approach has advantages for both formalisms, as for example implemented systems for one formalism are usable for the other, and properties such as computational complexity do not have to be rediscovered. As a first, concrete result of this kind, one stable model semantics based on program reducts and subset-minimality that reached a reasonable consensus for logic programs with generalized atoms provides a novel, alternative semantics for abstract dialectical frameworks.
We revise some results in Argumentation-based logic programming under the umbrella of Satisfiability Modulo CHR (SMCHR), specifically considering Defeasible logic programming (DeLP). Strict and defeasible rules in DeL...
详细信息
ISBN:
(纸本)9783319243092;9783319243085
We revise some results in Argumentation-based logic programming under the umbrella of Satisfiability Modulo CHR (SMCHR), specifically considering Defeasible logic programming (DeLP). Strict and defeasible rules in DeLP can be cast to SMCHR rules, which act as conflict "disentanglers" and implement the Theory part. At the same time, we inherit several built-in theory solvers, as SAT, unification, or linear arithmetic ones, which implement the Satisfiability-modulo part. Moreover, we show how to deal with possibilistic extensions of DeLP, i.e., Possibilistic-DeLP, where certainty scores describing the possibility of some events are associated with rules.
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we pre...
详细信息
ISBN:
(纸本)9781467375092
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we present an approach that addresses this problem by applying an argumentation-based scene interpretation framework for accurately modelling and representing the observations and beliefs of an agent. Our approach is based on temporal and probabilistic defeasible logic programming for reasoning. The performance of our approach is evaluated on simulation experiments in the Stage Robot Simulator. We also show that our approach is applicable to real world scenarios with an autonomous Pioneer 3-AT robot.
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set programming, a prominent rule-based declarative programm...
详细信息
ISBN:
(纸本)9783319234854;9783319234847
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set programming, a prominent rule-based declarative programming paradigm. A major approach is Oikarinnen and Janhunen's Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Their module theorem properly strengthens Lifschitz and Turner's splitting set theorem for normal logic programs. However, this approach is limited by module conditions that are imposed in order to ensure the compatibility of their module system with the stable model semantics, namely forcing output signatures of composing modules to be disjoint and disallowing positive cyclic dependencies between different modules. These conditions turn out to be too restrictive in practice and after recently discussing alternative ways of lifting the first restriction [17], we now show how one can allow positive cyclic dependencies between modules, thus widening the applicability of this framework and the scope of the module theorem.
In this paper, we study the expressive power of first-order disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-o...
详细信息
ISBN:
(纸本)9781577357384
In this paper, we study the expressive power of first-order disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-order DLP is strictly more expressive than NLP. This result still holds even if auxiliary predicates are allowed, assuming NP not equal coNP. On the other side, we propose a partial translation from first-order DLP to NLP via unfolding and shifting, which suggests a sound yet incomplete approach to implement DLP via NLP solvers. We also identify some NLP definable subclasses, and conjecture to exactly capture NLP definability by unfolding and shifting.
暂无评论