Stefano Bistarelli
Stefano Bistarelli

homepage
bistaatdmi.unipg.it

  Affiliation history
Bibliometrics: publication history
Average citations per article10.14
Citation Count1,044
Publication count103
Publication years1995-2018
Available for download16
Average downloads per article309.50
Downloads (cumulative)4,952
Downloads (12 Months)499
Downloads (6 Weeks)33
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


103 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 103
Result page: 1 2 3 4 5 6

Sort by:

1
January 2018 International Journal of Approximate Reasoning: Volume 92 Issue C, January 2018
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

When dealing with Weighted Abstract Argumentation, having weights on attacks clearly brings more information. The advantage, for instance, is the possibility to define a different notion of defence, checking also if the weight associated with it is stronger than the attack weight. In this work we study two different relaxations, ...
Keywords: Abstract Argumentation Frameworks, Relaxation, Semirings, Inconsistency tolerance, Weighted attacks

2
September 2017 Procedia Computer Science: Volume 112 Issue C, September 2017
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

The main aim of data mining techniques and tools is that of identify and extract, from a set of (big) data, implicit patterns which can describe static or dynamic phenomena. Among these latter business processes are gaining more and more attention due to their crucial role in modern organizations and ...
Keywords: business process mining, ontology, activity diagram

3 published by ACM
August 2017 ARES '17: Proceedings of the 12th International Conference on Availability, Reliability and Security
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 169,   Downloads (Overall): 169

Full text available: PDFPDF
Bitcoin is a cryptocurrency and a peer-to-peer payment system, where transactions directly take place between pseudo-anonymous users, without any centralised authority. Since the block-chain (i.e., the public ledger where transactions are registered) is an example of Big Data, a straightforward visualisation is not very informative. For this reason, we employ ...
Keywords: Analysis Tool, Bitcoin, Visual Analytics

4 published by ACM
April 2017 SAC '17: Proceedings of the Symposium on Applied Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 229,   Downloads (Overall): 286

Full text available: PDFPDF
In this work we re-adapt the Bitcoin e-payment system and propose it as a decentralised end-to-end voting platform (from voters to candidates). We describe the main architectural choices behind the implementation, which consists of the pre-voting, voting, and post-voting phases. The resulting implementation is completely decentralised: it is possible to ...
Keywords: bitcoin, electronic voting, verifiable voting-system

5
May 2016 Theoretical Computer Science: Volume 629 Issue C, May 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


6 published by ACM
April 2016 SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 9,   Downloads (Overall): 24

Full text available: PDFPDF
We propose a formal framework to model an automated adaptation protocol based on Quantitative Partial Model Checking (QPMC). An agent seeks the collaboration of a second agent to satisfy some (fixed) condition on the actions to be executed. The provided protocol allows the two agents to automatically agree by iteratively ...
Keywords: adaptation, multi-agent systems, partial model checking

7
November 2014 ICTAI '14: Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial Intelligence
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

We provide an extensive testing on how efficiently state-of-the art solvers are capable of solving credulous and sceptical argument-acceptance for lower-order extensions. In fact, as our benchmark we consider three different random graph-models to represent random Abstract Argumentation Frameworks: Barabasi and Erdos-Renyi networks, and, in addition, we also rework balanced ...
Keywords: Abstract Argumentation, Comparison, Acceptance

8
September 2014 ARES '14: Proceedings of the 2014 Ninth International Conference on Availability, Reliability and Security
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

In this paper we show how deductive and abductive reasoning in distributed authorisation can be efficiently ported to Android. Such logical-inference processes prove to be important tools due to the intrinsic autonomic-nature of these mobile devices. Both deduction and abduction are represented by using Constraint Handling Rules (CHR), a high-level ...

9
August 2014 ECAI'14: Proceedings of the Twenty-first European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

We compare three different implementations of reasoning tools dedicated to Abstract Argumentation Frameworks. These systems are ASPARTIX, ConArg2, and Dung-O-Matic. They have been tested over three different random graph-models, corresponding to the Erdős-Rényi model, Kleinberg small-world model, and scale-free Barabasi model.

10
July 2014 Fundamenta Informaticae - Theoretical Computer Science: Volume 134 Issue 3-4, July 2014
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

We present a fine-grained security model to enforce the access control on the shared constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a non-monotonic version of Soft CCP (SCCP), that is an extension of CCP where the constraints have a preference level associated with them. ...

11
October 2013 Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011: Volume 124 Issue 4, October 2013
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

The aggregation of generic items into coalitions leads to the creation of sets of homogenous entities. In this paper we accomplish this for an input set of arguments, and the result is a partition according to distinct lines of thought, i.e., groups of “coherent” ideas. We extend Dung's Argumentation Framework ...

12
February 2013 Annals of Mathematics and Artificial Intelligence: Volume 67 Issue 2, February 2013
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs). We introduce two notions: threshold ? and degradation factor ? ...
Keywords: Constraint satisfaction, Soft constraints, 68T30, Constraint optimization, Interchangeability

13
October 2012 CRISIS '12: Proceedings of the 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Semiring-based constraint models and frameworks have been extensively used in literature to optimize different security-related metrics, in order to represent trust scores, levels of security and, in general, quantitative information on shared resources to be securely managed. In this tutorial, we summarize four approaches that show an application of these ...
Keywords: Programming,Tutorials,Measurement,Cognition,Access control

14
October 2012 SEFM'12: Proceedings of the 10th international conference on Software Engineering and Formal Methods
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We present a fine-grained security model to enforce the access control on the shared constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP where the constraints have a preference level associated with them. ...

15 published by ACM
August 2012 SSW '12: Proceedings of the 2nd International Workshop on Semantic Search over the Web
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 3,   Downloads (Overall): 43

Full text available: PDFPDF
In this paper, we focus on the discovery process of Web Services (WSs) by basing the search on the similarities among the service requirements and candidate search results, in order to cope with over-constrained queries or to find satisfactory alternatives for user requirements. This discovery process needs to involve the ...

16
August 2012 Computers & Mathematics with Applications: Volume 64 Issue 4, August, 2012
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 0

We present a variant of the Datalog language (we call it Datalog^W), which is able to deal with weights on ground facts. The weights are chosen from a semiring algebraic structure. Our goal is to use this language as a semantic foundation for trust-management languages, in order to express trust ...
Keywords: Deduction, Role-based Trust-management languages, Abduction, Soft constraint

17 published by ACM
March 2012 SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 49

Full text available: PDFPDF
We present a fine-grained security model to enforce the access control on the constraint store in Concurrent Constraint Programming (CCP) languages. We show the model for a nonmonotonic version of Soft CCP (SCCP), that is an extension of CCP which deals with soft constraints, which are constraints that have a ...

18
February 2012 Expert Systems with Applications: An International Journal: Volume 39 Issue 2, February, 2012
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 0

We extend algorithms for local arc consistency proposed in the literature in order to deal with (absorptive) semirings that may not be invertible. As a consequence, these consistency algorithms can be used as a pre-processing procedure in soft Constraint Satisfaction Problems (CSPs) defined over a larger class of semirings, such ...
Keywords: Arc consistency, Multi-objective, Soft constraint, Invertible semiring

19
December 2011 Journal of Experimental & Theoretical Artificial Intelligence: Volume 23 Issue 4, December 2011
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 1

Preferences and uncertainty are common in many real-life problems. In this article, we focus on bipolar preferences and uncertainty modelled via uncontrollable variables, and we assume that uncontrollable variables are specified by possibility distributions over their domains. To tackle such problems, we concentrate on uncertain bipolar problems with totally ordered ...
Keywords: preferences, positive and negative judgements, uncertainty, possibility theory

20
November 2011 ICTAI '11: Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

We propose ConArg, a tool based on Constraint Programming, to model and solve various problems related to the Argumentation research field. Constraint Satisfaction Problems (CSPs) offer a wide number of efficient techniques (as inference and search algorithms) that can tackle the complexity in finding all the possible Dung's conflict-free, admissible, ...
Keywords: rgumentation Frameworks, Constraint Satisfaction Problems



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us