this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has ...
详细信息
ISBN:
(纸本)9783642405648
this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has a set of goals to achieve but these goals are normally unachievable without an agreement from the other agent. We design an alternating-offers procedure that shows how an agreement between two agents can be reached through a reasoning process based on answer set programming and abduction. We prove that the procedure converges to a Nash equilibrium if each player makes rational offer/counter-offer at each round.
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show h...
详细信息
ISBN:
(纸本)9783642405648
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.
We propose a portfolio-based solving approach to Answer Set programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. the selection among the configurations is reali...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
We propose a portfolio-based solving approach to Answer Set programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. the selection among the configurations is realized via Support Vector Regression. the resulting portfolio-based solver clasp-folio regularly outperforms clasp's default configuration as well as manual tuning.
We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.
ISBN:
(纸本)3540412859
We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.
the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the proc...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by LPARSE, DLV, and GRINGO, and the other cannot.
nonmonotoniclogicprogramming (NMLP) and inductive logicprogramming (ILP) are two important extensions of logicprogramming. the former aims at representing incomplete knowledge and reasoning with commonsense, while...
详细信息
the ability to perform complex reasoning over data streams has recently become an important area of research in the Semantic Web community. Most of SPARQL-inspired engines have limitations in capturing sophisticated u...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
the ability to perform complex reasoning over data streams has recently become an important area of research in the Semantic Web community. Most of SPARQL-inspired engines have limitations in capturing sophisticated user requirements and dealing with complex reasoning tasks. To address these challenges, we propose and implement C-ASP, a reasoning system based on the Answer Set programming (ASP) system Clingo and extended to handle continuous reasoning requests over RDF streams. We provide the syntax of the C-ASP language, as well as a set of examples in order to illustrate its expressive power. In addition, we present preliminary experimental results showing C-ASP performances.
In this paper, we propose a new semantics for disjunctive logicprogramming and deductive databases. the semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs...
详细信息
ISBN:
(纸本)3540667490
In this paper, we propose a new semantics for disjunctive logicprogramming and deductive databases. the semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, the minimal founded semantics seems to be, in some case, more intuitive, it gives meaning to programs which are meaningless under stable model semantics and it is not harder to compute. We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power of disjunctive stable model semantics. We also present a variation of the minimal founded semantics, called strongly founded which on stratified programs coincide withthe perfect model semantics.
this volume contains the refereed proceedings of the 11thinternationalconference on logicprogramming and nonmonotonicreasoning, LPNMR 2011, held in May 2011 in Vancouver, Canada.the 16 revised full papers (13 tech...
详细信息
ISBN:
(数字)9783642208959
ISBN:
(纸本)9783642208942
this volume contains the refereed proceedings of the 11thinternationalconference on logicprogramming and nonmonotonicreasoning, LPNMR 2011, held in May 2011 in Vancouver, Canada.
the 16 revised full papers (13 technical papers, 1 application description, and 2 system descriptions) and 26 short papers (16 technical papers, 3 application description, and 7 system descriptions) which were carefully reviewed and selected from numerous submissions, are presented together with 3 invited talks. Being a forum for exchanging ideas on declarative logicprogramming, nonmonotonicreasoning, and knowledge representation, the conference aims to facilitate interactions between those researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those who work in the area of knowledge representation and nonmonotonicreasoning.
We explore the use, of Constraint;Lopic programming (CLP) as a platform for experimenting with planning domains ill presence of multiple interacting agents. We develop a novel constraint-based action language B-MAP th...
详细信息
ISBN:
(纸本)9783642042379
We explore the use, of Constraint;Lopic programming (CLP) as a platform for experimenting with planning domains ill presence of multiple interacting agents. We develop a novel constraint-based action language B-MAP that enables the declarative description of large classes of multi-agent and multi-valued domains. B-MAP supports several complex features, including combined effects. concurrency constraint, interacting actions,. mid delayed effects.
暂无评论