Many multi-agent system applications involve software agents that reason about the behavior of other agents with which they interact in cooperation or competition. In order to design and develop those systems, the emp...
详细信息
the proceedings contain 45 papers. the topics discussed include: symmetry breaking for distributed multi-context systems;splitting an argumentation framework;reactive answer set programming;communicating ASP and the p...
ISBN:
(纸本)9783642208942
the proceedings contain 45 papers. the topics discussed include: symmetry breaking for distributed multi-context systems;splitting an argumentation framework;reactive answer set programming;communicating ASP and the polynomial hierarchy;loop formulas for splitable temporal logic programs;pushing efficient evaluation of HEX programs by modular decomposition;approximations for explanations of inconsistency in partially known multi-context systems;relational information exchange and aggregation in multi-context systems;stepping through an answer-set program;dynamic magic sets for programs with monotone recursive aggregates;strong equivalence of logic programs with abstract constraint atoms;partial preferences and ambiguity resolution in contextual defeasible logic;on influence and contractions in defeasible logicprogramming;termination of grounding is not preserved by strongly equivalent transformations;and aggregates in answer set optimization.
In the object-oriented world, much effort is spent into the development of dedicated tools to ease programming and to prevent programming errors. Recently, the techniques of model-driven engineering (MDE) have been pr...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In the object-oriented world, much effort is spent into the development of dedicated tools to ease programming and to prevent programming errors. Recently, the techniques of model-driven engineering (MDE) have been proven especially valuable to manage the complexity of modern software systems during the software development process. In the world of answer-set programming (ASP), the situation is different. Much effort is invested into the development of efficient solvers, but the pragmatics of programming itself has not received much attention and more tool support to ease the actual programming phase would be desirable. To address this issue, we introduce the tool VIDEAS which graphically supports the partial specification of answer-set programs, applying technologies provided by MDE.
Answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Answer-set programming (ASP) is an established paradigm for declarative problem solving, yet comparably little work on testing of answer-set programs has been done so far. In a recent paper, foundations for structure-based testing of answer-set programs building on a number of coverage notions have been proposed. In this paper, we develop a framework for testing answer-set programs based on this work and study how good the structure-based approach to test input generation is compared to random test input generation. the results indicate that random testing is quite ineffective for some benchmarks, while structure-based techniques catch faults with a high rate more consistently also in these cases.
Transaction logic is an extension of classical logicthat gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many advanced applications, including modelin...
详细信息
ISBN:
(纸本)9783939897316
Transaction logic is an extension of classical logicthat gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many advanced applications, including modeling robot movements, actions specification, and planning in artificialintelligence. In a parallel development, much work has been devoted to various theories of defeasible reasoning. In this paper, we unify these two streams of research and develop Transaction logic with Defaults and Argumentation theories, an extension of both Transaction logic and the recently proposed unifying framework for defeasible reasoning called logic Programs with Defaults and Argumentation theories. We show that this combination has a number of interesting applications, including specification of defaults in action theories and heuristics for directed search in artificialintelligence planning problems. We also demonstrate the usefulness of the approach by experimenting with a prototype of the logic and showing how heuristics expressed as defeasible actions can significantly reduce the search space as well as execution time and space requirements.
We investigate an alternative language for equilibrium logicthat is based on the concept of positive and negative contingency. Beyond these two concepts our language has the modal operators of necessity and impossibi...
详细信息
Goals are central to the design and implementation of intelligent software agents. Much of the literature on goals and reasoning about goals in agent programming frameworks only deals with a limited set of goal types,...
详细信息
Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, FO(.), PDDL and many oth...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, FO(.), PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. the third ASP Competition, as the sequel to the ASP Competitions Series held at the University of Potsdam in Germany (2006-2007) and at the University of Leuven in Belgium in 2009, took place at the University of Calabria (Italy) in the first half of 2011. Participants competed on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. the Competition ran on two tracks: the Model & Solve Competition, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm;and the System Competition, held on the basis of fixed, public problem encodings, written in a standard ASP language. this paper briefly discuss the format and rationale of the System competition track, and preliminarily reports its results.
the aim of this paper is to offer an argumentation-based defeasible logicthat enables temporal forward reasoning. We extend the DeLP logical framework by associating temporal parameters to literals. A temporal logic ...
详细信息
ISBN:
(纸本)9783642239625;9783642239632
the aim of this paper is to offer an argumentation-based defeasible logicthat enables temporal forward reasoning. We extend the DeLP logical framework by associating temporal parameters to literals. A temporal logic program is a set of temporal literals and durative rules. these temporal facts and rules combine into durative arguments representing temporal processes, that permit us to reason defeasibly about future states. the corresponding notion of logical consequence, or warrant, is defined slightly different from that of DeLP, due to the temporal aspects. As usual, this notion takes care of inconsistencies, and in particular we prove the consistency of any logical program whose strict part is consistent. Finally, we define and study a sub-class of arguments that seem appropriate to reason with natural processes, and suggest a modification to the framework that is equivalent to restricting the logic to this class of arguments.
the Robocup 2D simulation competition [13] proposes a dynamic environment where two opponent teams are confronted in a simplified soccer game. All major teams use a fixed algorithm to control its players. An unexpecte...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
the Robocup 2D simulation competition [13] proposes a dynamic environment where two opponent teams are confronted in a simplified soccer game. All major teams use a fixed algorithm to control its players. An unexpected opponent strategy, not previously considered by the developers, might result in winning all matches. To improve this we use ILP to learn action descriptions of opponent players;for learning on dynamic domains, we have to deal withthe frame problem. the induced descriptions can be used to plan for desired field states. To show this we start with a simplified scenario where we learn the behaviour of a goalkeeper based on the actions of a shooter player. this description is used to plan for states where a goal can be scored. this result can directly be extended to a multiplayer environment.
暂无评论