Autosoft Journal

Online Manuscript Access

A Complex Networked Method of Sorting Negotiation Demand Based on Answer Set Programs



With the development of big data science, handling intensive knowledge in the complex network becomes more and more important. Knowledge representation of multi-agent negotiation in the complex network plays an important role in big data science. As a modern approach to declarative programming, answer set programming is widely applied in representing the multi-agent negotiation knowledge in recent years. But almost all the relevant negotiation models are based on complete rational agents, which make the negotiation process complex and low efficient. Sorting negotiation demands is the most key step in creating an efficient negotiation model to improve the negotiation ability of agents. Traditional sorting method is not suitable for the negotiation in the complex network. In this paper, we propose a complex networked negotiation, which can show the relationships among demands, and then a sorting method of negotiation demands is proposed based on demand relationships. What’s more, we use the betweenness of literals and the boundary co-efficient of rules to evaluate the importance of demands and rules.



Total Pages: 6
Pages: 35-40


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways

Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Volume: 24
Issue: 1
Year: 2018

Cite this document


Albert, Réka, and Albert-László Barabási. "Statistical Mechanics of Complex Networks." Reviews of Modern Physics 74.1 (2002): 47-97. Crossref. Web.

Baral, Chitta. "Knowledge Representation, Reasoning and Declarative Problem Solving." (2003): n. pag. Crossref. Web.

Boccaletti, Stefano et al. "Multiscale Vulnerability of Complex Networks." Chaos: An Interdisciplinary Journal of Nonlinear Science 17.4 (2007): 043110. Crossref. Web.

Brewka, Gerhard, and Thomas Eiter. "Preferred Answer Sets for Extended Logic Programs." Artificial Intelligence 109.1-2 (1999): 297-356. Crossref. Web.

Chen, Wu, Ming-Yi Zhang, and Mao-Nian Wu. "A Logic-Program-Based Negotiation Mechanism." Journal of Computer Science and Technology 24.4 (2009): 753-760. Crossref. Web.

Gelfond, Michael, and Vladimir Lifschitz. "Classical Negation in Logic Programs and Disjunctive Databases." New Generation Computing 9.3-4 (1991): 365-385. Crossref. Web.

Jiang, Chaozhe et al. "Characteristics and Reliability Analysis of the Complex Network In Guangzhou Rail Transit." Intelligent Automation & Soft Computing 19.2 (2013): 217-225. Crossref. Web.

Marrone, Stefano et al. "Vulnerability Modeling and Analysis for Critical Infrastructure Protection Applications." International Journal of Critical Infrastructure Protection 6.3-4 (2013): 217-227. Crossref. Web.

Mishkovski, Igor, Mario Biey, and Ljupco Kocarev. "Vulnerability of Complex Networks." Communications in Nonlinear Science and Numerical Simulation 16.1 (2011): 341-349. Crossref. Web.

Son, Tran Cao et al. "Formalizing Negotiations Using Logic Programming." ACM Transactions on Computational Logic 15.2 (2014): 1-30. Crossref. Web.

West D. B. Introduction to Graph Theory


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)

SJR: "The two years line is equivalent to journal impact factor ™ (Thomson Reuters) metric."

Journal: 1995-Present


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048