We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-deterministic computations in functional logic pro...
详细信息
Updating agents' knowledge bases is an important topic in Artificial Intelligence and a key problem of knowledge representation and reasoning. One of the latest ideas to update logic programs is to use abduction b...
详细信息
ISBN:
(纸本)9780889867550
Updating agents' knowledge bases is an important topic in Artificial Intelligence and a key problem of knowledge representation and reasoning. One of the latest ideas to update logic programs is to use abduction by means of Minimal Generalised Answer Sets (MGAS). MGAS provide a more general and flexible semantics than standard ASP , and we propose it to overcome disadvantages of previous approaches as well as to simplify both the semantics definition and its implementation. Moreover, the author provides a link to a modest online prototype of the semantics here introduced. This prototype models updates in a well-known Disjunctive Datalog, DLV, which is an implementation (solver) for Answer Set programming. Accordingly, the two-fold contribution of this paper is showing a simpler theoretical framework characterised in DLV's weak constraints, as well as an outline of the basic structure of its implementation, description of the employed technology.
Instruction selection is a compiler optimisation that translates the intermediate representation of a program into a lower intermediate representation or an assembler program. We use the SSA form as an intermediate re...
详细信息
ISBN:
(纸本)9781450378345
Instruction selection is a compiler optimisation that translates the intermediate representation of a program into a lower intermediate representation or an assembler program. We use the SSA form as an intermediate representation for instruction selection. Patterns are used for translation and are expressed as production rules in a graph grammar. The instruction selector seeks for a syntax derivation with minimal costs optimising execution time, code size, or a combination of both. Production rules are either base rules which match nodes in the SSA graph or chain rules which convert results of operations. We present a new algorithm for placing chain rules in a control flow graph. This new algorithm places chain rules optimally for an arbitrary cost metric. Experiments with the MiBench and SPEC2000 benchmark suites show that our proposed algorithm is feasible and always yields better results than simple strategies currently in use. We reduce the costs for placing chain rules by 25% for the MiBench suite and by 11% for the SPEC2000 suite.
We present a method for the automated verification of temporal properties of infinite state systems. Our verification method is based on the specialization of constraint logic programs (CLP) and works in two phases: (...
详细信息
We present reductions from Dung's argumentation framework (AF) and generalizations thereof to logic programs under the answer-set semantics. The reduction is based on a fixed disjunctive datalog program (the inter...
详细信息
We have constructed a computational platform that incorporates principles of biological development and primitives derived from cell biology into a rule-based architecture. When coupled to an evolutionary search, this...
详细信息
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes...
详细信息
This paper presents a framework that integrates three aspects of agency: planning, for proactive behaviour, negotiation, for social behaviour and resource achievement, and control of operation, for reconciling rationa...
详细信息
ISBN:
(纸本)9781586034528
This paper presents a framework that integrates three aspects of agency: planning, for proactive behaviour, negotiation, for social behaviour and resource achievement, and control of operation, for reconciling rationality with reactivity. Agents are designed and programmed in a computational logic-based language where these aspects are accommodated in a declarative and modular way. We show how this framework can be applied to agent problems requiring negotiation and resource achievement and present some of its formal properties. The framework can be implemented based on a communication platform for agent interaction and on well-established logic programming technologies for agent reasoning.
Answer Set programming (ASP) is a well-known AI formalism. Traditional ASP systems, that follow the "ground&solve" approach, are intrinsically limited by the so-called grounding bottleneck. Basically, th...
详细信息
After a brief introduction on the necessity of an explicit domain description for logic knowledge bases and the advantages of many-sorted logics, we argue that domain representation may consist of a separate logic the...
详细信息
暂无评论