Settling on the group's goals: An n-person argumentation game approach

Argumentation games have been proved to be a robust and flexible tool to resolve conflicts among agents. An agent can propose its explanation and its goal known as a claim, which can be refuted by other agents. The situation is more complicated when there are more than two agents playing the game. We propose a weighting mechanism for competing premises to tackle with conflicts from multiple agents in an n-person game. An agent can defend its proposal by giving a counter-argument to change the ``opinion'' of the majority of opposing agents. During the game, an agent can exploit the knowledge that other agents expose in order to promote and defend its main claim

Declarative logic programming with primitive recursive relations on lists

In a previous paper we introduced a system of recursion operators for formulating pure logic programs, dispensing with explicit recursions. The recursion operators, some of which are similar to higher-order functions known from functional programming, take the form of quasi-higher order predicates. In this paper we identify a comprehensive class of logic programs called primitive recursive relations over lists (including primitive recursive functions) using the so called fold recursion operators. We formulate and prove a duality theorem connecting our relational fold operators. We show how correct well-moded procedural interpretations using any fixed computation rule can be obtained from a declarative logic program. This is accomplished in a principled manner by a simplified data flow analysis enabled by the recursion operator formulation and the duality theorem. The recursion operators are handled in ordinary clauses by means of established metalogic programming techniques. Keywords:..

Eighty-year-old men without cardiovascular disease in the community of Malmö. Part II. Smoking characteristics and ultrasound findings, with special reference to glutathione transferase and pyridoxal-5-phosphate

A total of 1280 80-year-old men in the community of Malmö were questioned about smoking habits and the occurrence of cardiovascular disease (CVD). After a careful medical and duplex ultrasound examination, four groups were selected for further studies: (1) no CVD, non-smokers: (2) no CVD, smokers: (3) CVD, smokers: (4) CVD, non-smokers. In total 122 individuals participated. The average tobacco consumption by smokers was 13 g d-1 for 59 years. In the CVD group 45% of subjects had atherosclerotic symptoms at more than one site. Smoking was found to be correlated with lower extremity atherosclerosis, cholesterol and LDL cholesterol were correlated with carotid artery lesions and pathological ankle/arm index, and blood pressure was correlated with lower extremity lesions. In contrast with middle-aged populations, individuals with an increasing degree of lesions in the lower extremities had a larger percentage of high glutathione transferase activity than subjects without CVD. Smokers had significantly lower pyridoxal-5-phosphate levels than non-smokers. It is concluded that some heavy smokers might reach an advanced age in good health. Smoking was also operative as a risk indicator for lower extremity atherosclerosis in 80-year-old individuals

Compositional Relational Programming with Name Projection and Compositional Synthesis

CombInduce is a methodology for inductive synthesis of logic programs, which employs a reversible meta-interpreter for synthesis, and uses a compositional relational target language for ecient synthesis of recursive predicates. The target language, Combilog, has reduced usability due to the lack of variables, a feature enforced by the principle of compositionality, which is at the core of the synthesis process. We present a revision of Combilog, namely, Combilog with Name Projection (CNP), which brings improved usability by using argument names, whilst still staying devoid of variables, preserving the compositionality

Suojareleiden mittausketjun signaalinkäsittely

Since the early days of programming and automated reasoning, researchers have developed methods for systematically constructing programs from their specifications. Especially the last decade has seen a flurry of activities including the advent of specialized conferences, such as LOPSTR, covering the synthesis of programs in computational logic. In this paper we analyze and compare three state-of-the-art methods for synthesizing recursive programs in computational logic. The three approaches axe constructive/deductive synthesis, schema-guided synthesis, AA and inductive synthesis. Our comparison is carried out in a systematic way where, for each approach, we describe the key ideas and synthesize a common running example. In doing so, we explore the synergies between the approaches, which we believe are necessary in order to achieve progress over the next decade in this field

Querying Class-Relationship Logic in a Metalogic Framework

We introduce a class relationship logic for stating various forms of logical relationships between classes. This logic is intended for ontologies and knowledge bases and combinations thereof. Reasoning and querying is conducted in the DATALOC logical language, which serves as an embracing decidable and tractable metalogic