Foundations of Information and Knowledge Systems

We analyze the acceptability dynamics of arguments through the proposal of two different kinds of minimal sets of arguments, core and remainder sets which are somehow responsible for the acceptability/rejection of a given argument. We develop a study of the consequences of breaking the construction of such sets towards the acceptance, and/or rejection, of an analyzed argument. This brings about the proposal of novel change operations for abstract argumentation first, and for logic-based argumentation, afterwards. The analysis upon logicbased argumentation shows some problems regarding the applicability of the standard semantics. In consequence, a reformulation of the notion of admissibility arises for accommodating the standard semantics upon logic-based argumentation. Finally, the proposed model is formalized in the light of the theory of belief revision by characterizing the corresponding operations through rationality postulates and representation theorems.

[1]  Joshua Zhexue Huang,et al.  Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values , 1998, Data Mining and Knowledge Discovery.

[2]  Wolfgang Spohn,et al.  Ordinal Conditional Functions: A Dynamic Theory of Epistemic States , 1988 .

[3]  Dorothy E. Denning,et al.  Inference Controls for Statistical Databases , 1983, Computer.

[4]  Fred B. Schneider,et al.  Enforceable security policies , 2000, Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems].

[5]  Joachim Biskup,et al.  Preprocessing for controlled query evaluation with availability policy , 2008, J. Comput. Secur..

[6]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[7]  Bernhard Thalheim,et al.  Entity-relationship modeling - foundations of database technology , 2010 .

[8]  Ashwin Machanavajjhala,et al.  l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.

[9]  Sushil Jajodia,et al.  Combining fragmentation and encryption to protect privacy in data storage , 2010, TSEC.

[10]  Selim G. Akl,et al.  Views for Multilevel Database Security , 1986, 1986 IEEE Symposium on Security and Privacy.

[11]  Sudipto Guha,et al.  CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.

[12]  Yi Li,et al.  COOLCAT: an entropy-based algorithm for categorical clustering , 2002, CIKM '02.

[13]  Jay Ligatti,et al.  A Theory of Gray Security Policies , 2015, ESORICS.

[14]  Sharad Malik,et al.  Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.

[15]  Sarit Kraus,et al.  Foundations of Secure Deductive Databases , 1995, IEEE Trans. Knowl. Data Eng..

[16]  Sushil Jajodia,et al.  The inference problem: a survey , 2002, SKDD.

[17]  Martin Diller,et al.  An Extension-Based Approach to Belief Revision in Abstract Argumentation , 2015, IJCAI.

[18]  Richard L. Mendelsohn,et al.  First-Order Modal Logic , 1998 .

[19]  Zhexue Huang,et al.  CLUSTERING LARGE DATA SETS WITH MIXED NUMERIC AND CATEGORICAL VALUES , 1997 .

[20]  Thomas Studer,et al.  Censors for Boolean Description Logic , 2014, Trans. Data Priv..

[21]  Renata Wassermann,et al.  Inconsistent-tolerant base revision through Argument Theory Change , 2012, Log. J. IGPL.

[22]  Vipin Kumar,et al.  Similarity Measures for Categorical Data: A Comparative Evaluation , 2008, SDM.

[23]  Johannes Gehrke,et al.  CACTUS—clustering categorical data using summaries , 1999, KDD '99.

[24]  Michael K. Ng,et al.  On the Impact of Dissimilarity Measure in k-Modes Clustering Algorithm , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Dekang Lin,et al.  An Information-Theoretic Definition of Similarity , 1998, ICML.

[26]  Joseph Y. Halpern,et al.  Secrecy in Multiagent Systems , 2008, TSEC.

[27]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[28]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2017, Journal of Automated Reasoning.

[29]  J. Aitchison,et al.  Multivariate binary discrimination by the kernel method , 1976 .

[30]  Sudipto Guha,et al.  ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[31]  Joachim Biskup,et al.  A sound and complete model-generation procedure for consistent and confidentiality-preserving databases , 2011, Theor. Comput. Sci..

[32]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

[33]  James C. Bezdek,et al.  Local convergence of the fuzzy c-Means algorithms , 1986, Pattern Recognit..

[34]  Hector J. Levesque,et al.  Knowledge Representation and Reasoning , 2004 .

[35]  Ruggero G. Pensa,et al.  Context-Based Distance Learning for Categorical Data Clustering , 2009, IDA.

[36]  Shengrui Wang,et al.  Central Clustering of Categorical Data with Automated Feature Weighting , 2013, IJCAI.

[37]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[38]  Joseph Y. Halpern,et al.  Plausibility measures and default reasoning , 1996, JACM.

[39]  Piero A. Bonatti,et al.  A Confidentiality Model for Ontologies , 2013, International Semantic Web Conference.

[40]  Michael K. Ng,et al.  A fuzzy k-modes algorithm for clustering categorical data , 1999, IEEE Trans. Fuzzy Syst..

[41]  Sébastien Konieczny,et al.  On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses , 2014, KR.

[42]  Guillermo Ricardo Simari,et al.  Argument Theory Change: Revision Upon Warrant , 2008, COMMA.

[43]  Sébastien Konieczny,et al.  Extension Enforcement in Abstract Argumentation as an Optimization Problem , 2015, IJCAI.

[44]  Henryk Wozniakowski,et al.  The statistical security of a statistical database , 1984, TODS.

[45]  Iyad Rahwan,et al.  Quantifying disagreement in argument-based reasoning , 2012, AAMAS.

[46]  Piero A. Bonatti,et al.  Optimized Construction of Secure Knowledge-Base Views , 2015, Description Logics.

[47]  J. A. Robinson,et al.  Handbook of Automated Reasoning (in 2 volumes) , 2001 .

[48]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[49]  Sushil Jajodia,et al.  Fragmentation in Presence of Data Dependencies , 2014, IEEE Transactions on Dependable and Secure Computing.

[50]  H. Ralambondrainy,et al.  A conceptual version of the K-means algorithm , 1995, Pattern Recognit. Lett..

[51]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[52]  David Sands,et al.  Dimensions and principles of declassification , 2005, 18th IEEE Computer Security Foundations Workshop (CSFW'05).

[53]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[54]  Michael K. Ng,et al.  Automated variable weighting in k-means type clustering , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[55]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[56]  Anthony Hunter,et al.  Instantiating abstract argumentation with classical logic arguments: Postulates and properties , 2011, Artif. Intell..

[57]  Ruggero G. Pensa,et al.  From Context to Distance: Learning Dissimilarity for Categorical Data Clustering , 2012, TKDD.

[58]  James W. Gray,et al.  Toward a mathematical foundation for information flow security , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[59]  Reind P. van de Riet,et al.  Answering queries without revealing secrets , 1983, TODS.

[60]  Ohn Mar San,et al.  An alternative extension of the k-means algorithm for clustering categorical data , 2004 .

[61]  Ringo Baumann,et al.  AGM Meets Abstract Argumentation: Expansion and Revision for Dung Frameworks , 2015, IJCAI.

[62]  Sushil Jajodia,et al.  Polyinstantation for Cover Stories , 1992, ESORICS.

[63]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[64]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[65]  Torsten Werner.  Introduction To Privacy Preserving Data Publishing Concepts And Techniques , 2016 .

[66]  Jay Ligatti,et al.  Modeling runtime enforcement with mandatory results automata , 2014, International Journal of Information Security.

[67]  Isaac Levi.  Subjunctives, dispositions and chances , 1977 .

[68]  Dorothy E. Denning,et al.  The SeaView Security Model , 1990, IEEE Trans. Software Eng..

[69]  Ringo Baumann.  What Does it Take to Enforce an Argument? Minimal Change in abstract Argumentation , 2012, ECAI.

[70]  Sushil Jajodia,et al.  Secure Data Management in Decentralized Systems , 2014, Secure Data Management in Decentralized Systems.

[71]  Joao Marques-Silva,et al.  Empirical Study of the Anatomy of Modern Sat Solvers , 2011, SAT.

[72]  Michael Schmidt,et al.  Foundations of SPARQL query optimization , 2008, ICDT '10.

[73]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[74]  Rajeev Motwani,et al.  Distributing data for secure database services , 2011, PAIS '11.

[75]  Jon M. Kleinberg,et al.  Clustering categorical data: an approach based on dynamical systems , 2000, The VLDB Journal.

[76]  Leila Amgoud,et al.  Postulates for logic-based argumentation systems , 2014, Int. J. Approx. Reason..

[77]  Panayiotis Tsaparas,et al.  Limbo: A scalable algorithm to cluster categorical data , 2003 .

[78]  Frédéric Cuppens,et al.  Cover story management , 2001, Data Knowl. Eng..

[79]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[80]  Gerhard Lakemeyer,et al.  The logic of knowledge bases , 2000 .

[81]  L. Hubert,et al.  Comparing partitions , 1985 .

[82]  Ringo Baumann,et al.  Expanding Argumentation Frameworks: Enforcing and Monotonicity Results , 2010, COMMA.

[83]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[84]  Lucas Bordeaux,et al.  Propositional Satisfiability and Constraint Programming: A comparative survey , 2006, CSUR.

[85]  Guillermo Ricardo Simari,et al.  Argument Theory Change Applied to Defeasible Logic Programming , 2008, AAAI.