Studying Transaction Fees in the Bitcoin Blockchain with Probabilistic Logic Programming

Azzolini, Damiano; Riguzzi, Fabrizio; Lamma, Evelina

doi:10.3390/info10110335

Cited by 19 publications

(8 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The researches on transaction fees introduced above are more focused on the user perspective, but the transaction fees are crucial to miners as well. Transaction fees as the extra reward are the economical incentive to sustain mining operations [17]. Furthermore, when miners cannot profit from the mining process, they may switch from the current blockchain platform to another one for mining [18].…”

Section: Related Workmentioning

confidence: 99%

A Novel Pricing Mechanism for User Coalition in Blockchain

Jiang

Liu

Dai

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

As the blockchain platform is widely used as a new trading way, both participants and transaction volume in the blockchain projects have been growing by leaps and bounds. The generic mechanisms of ranking transaction priorities are heavily dependent on the transaction fees the users append into each transaction; then, all transactions are ranked in the nonincreasing order according to the transaction fee amounts, and the selected transactions will be packed into a new created block in order based on the ranking results. However, more complex influence factors more than transaction fees on transaction priority ranking results are not taken into consideration in the generic transaction priority ranking mechanisms, and a single user is the objective to create transactions in these mechanisms. In order to optimize the generic transaction priority ranking mechanisms and enrich transaction creation modes, a novel user-coalition-based transaction pricing mechanism (UCTPM) is proposed, and the user coalition quality score, user coalition contribution degree, and the transaction type demand degree are formulated and introduced into the UCTPM mechanism. Our research findings indicate that the UCTPM mechanism satisfies the economic attributes of budget balanced, individual rationality, and incentive compatibility when the user coalition contribution degree increases through theoretical proof and experimental analysis. Moreover, the UCTPM mechanism allows all the transactions to be processed more efficiently by experimental analysis.

show abstract

Section: Related Workmentioning

confidence: 99%

A Novel Pricing Mechanism for User Coalition in Blockchain

Jiang

Liu

Dai

2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…The power and expressivity of Probabilistic Logic Programming (PLP) [8,18] have been utilized to represent many real world situations [2,9,14]. Usually, probabilistic logic programs involve only discrete random variables with Bernoulli or Categorical distributions.…”

Section: Introductionmentioning

confidence: 99%

Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

Azzolini¹,

Riguzzi²

2021

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Hybrid probabilistic logic programs can represent several scenarios thanks to the expressivity of Logic Programming extended with facts representing discrete and continuous distributions. The semantics for this type of programs is crucial since it ensures that a probability can be assigned to every query. Here, following one recent semantics proposal, we illustrate a concrete syntax, and we analyse the syntactic requirements needed to preserve the well-definedness.

show abstract

“…Standard LP syntax, and LP-based reasoning is the base for a variety of more expressive languages, and proof procedures. In particular, Probabilistic Logic Programming (PLP) (De Raedt and Kersting 2008) languages are simple yet powerful enough to represent different scenarios (Azzolini et al . 2019;Nguembang Fadja and Riguzzi 2017).…”

Section: Introductionmentioning

confidence: 99%

Nonground Abductive Logic Programming with Probabilistic Integrity Constraints

Bellodi¹,

Gavanelli²,

Zese³

et al. 2021

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Uncertain information is being taken into account in an increasing number of application fields. In the meantime, abduction has been proved a powerful tool for handling hypothetical reasoning and incomplete knowledge. Probabilistic logical models are a suitable framework to handle uncertain information, and in the last decade many probabilistic logical languages have been proposed, as well as inference and learning systems for them. In the realm of Abductive Logic Programming (ALP), a variety of proof procedures have been defined as well. In this paper, we consider a richer logic language, coping with probabilistic abduction with variables. In particular, we consider an ALP program enriched with integrity constraints à la IFF, possibly annotated with a probability value. We first present the overall abductive language and its semantics according to the Distribution Semantics. We then introduce a proof procedure, obtained by extending one previously presented, and prove its soundness and completeness.

show abstract

Studying Transaction Fees in the Bitcoin Blockchain with Probabilistic Logic Programming

Cited by 19 publications

References 32 publications

A Novel Pricing Mechanism for User Coalition in Blockchain

A Novel Pricing Mechanism for User Coalition in Blockchain

Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

Nonground Abductive Logic Programming with Probabilistic Integrity Constraints

Contact Info

Product

Resources

About