Over the last years several new approaches for modeling situations, actions, and causality within a deductive framework were proposed. These new approaches treat the facts about a situation as resources, which are con...
详细信息
An overview of today's automotive industry reminds us about an ever-increasing demand for passenger comfort, safety and zero emissions vehicles. Drivers are also seeking improvements in the handling stability at h...
详细信息
The systematic modelling of dynamic spatial systems is a key requirement in a wide range of application areas such as commonsense cognitive robotics, computer-aided architecture design, and dynamic geographic informat...
详细信息
This paper studies an abduction problem in formal argumentation frameworks. Given an argument, an agent verifies whether the argument is justified or not in its argumentation framework. If the argument is not justifie...
详细信息
ISBN:
(纸本)9783319100616;9783319100609
This paper studies an abduction problem in formal argumentation frameworks. Given an argument, an agent verifies whether the argument is justified or not in its argumentation framework. If the argument is not justified, the agent seeks conditions to explain the argument in its argumentation framework. We formulate such abductive reasoning in argumentation semantics and provide its computation in logic programming. Next we apply abduction in argumentation frameworks to reasoning by players in debate games. In debate games, two players have their own argumentation frameworks and each player builds claims to refute the opponent. A player may provide false or inaccurate arguments as a tactic to win the game. We show that abduction is used not only for seeking counter-claims but also for building dishonest claims in debate games.
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known to be difficult. We show that it can ...
详细信息
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known to be difficult. We show that it can remove all lists from definitions involving zip-like functions and functions using accumulating parameters.
The dynamic flowgraph methodology (DFM) is a promising way to find the prime implicants of a top event for a dynamic system possibly containing digital subsystems. This paper demonstrates how to express dynamic flowgr...
详细信息
The Janus programming language, viewed as the assembler for an abstract machine with a tree-based memory system, is of theoretical and practical interest, e.g., Pascal compilers. Many widely accepted theoretical formu...
详细信息
In this paper we present a new method for reasoning abductively over instances of a triples ontology. We compute the usefulness of evidence toward making an inference rather than its truth value, probabilistic or othe...
详细信息
We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing represe...
详细信息
We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a topdown framework. In particular, we define the abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. Our experimental evaluation supports the conclusion that, for inferring set-sharing, as it was the case for inferring pair-sharing, precision losses are limited, while useful efficiency gains are obtained. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.
We introduce the consistent topological structure and neighborhood structure into the logical framework for providing the logical foundation and logical normalization for the approximate reasoning. We present the conc...
详细信息
暂无评论