This paper describes a system called SITAC based on our proposed approach to discover concepts (called SITACs) in text archives that are identical semantically but alter their names over time. Our approach integrates natural language processing, association rule mining and contextual similarity to discover SITACs in order to answer historical queries over text corpora.

Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables. In the most common approach, association rules are parameterized by a lower bound on their confidence, which is the empirical conditional probability of their consequent given the antecedent, and/or by some other parameter bounds such as "support" or deviation from independence. We study here notions of redundancy among association rules from a fundamental perspective. We see each transaction in a dataset as an interpretation (or model) in the propositional logic sense, and consider existing notions of redundancy, that is, of logical entailment, among association rules, of the form "any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant". We discuss several existing alternative definitions of redundancy between association rules and provide new characterizations and relationships among them. We show that the main alternatives we discuss correspond actually to just two variants, which differ in the treatment of full-confidence implications. For each of these two notions of redundancy, we provide a sound and complete deduction calculus, and we show how to construct complete bases (that is, axiomatizations) of absolutely minimum size in terms of the number of rules. We explore finally an approach to redundancy with respect to several association rules, and fully characterize its simplest case of two partial premises.

We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules, called "ForallExists-rules," have the same logical form as TGD (tuple-generating dependencies) in databases and as conceptual graph rules. The aim of this paper is to provide a clearer picture of the frontier between decidability and non-decidability of reasoning with these rules. We show that Deduction remains undecidable with a single rule; then we show that none of the known abstract decidable classes is recognizable. Turning our attention to concrete decidable classes, we provide new classes and classify all known classes by inclusion. Finally, we study, in a systematic way, the question "given two decidable sets of rules, is their union decidable?" and provide an answer for all known decidable cases except one.

This paper addresses the problem of collective decision making in the case where the agents' preferences are represented by CP-nets (Conditional Preference Networks). Most existing works either do not consider the computational issues, or depend on a strong assumption that all the agents share a common preferential independence structure. To this end, this paper proposes an efficient approach, called CDMCP (Collective Decision Making with CP-nets), for aggregating multiple agents’ preferences according to majority rule. The proposed approach allows the agents to have different preferential independence structures and is computationally efficient.

Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted action-selection rules for guiding greedy search with application to automated planning. We make two primary contributions over prior work on learning for greedy search. First, we introduce weighted sets of action-selection rules as a new form of control knowledge for greedy search. Prior work has shown the utility of action-selection rules for greedy search, but has treated the rules as hard constraints, resulting in brittleness. Our weighted rule sets allow multiple rules to vote, helping to improve robustness to noisy rules. Second, we give a new iterative learning algorithm for learning weighted rule sets based on RankBoost, an efficient boosting algorithm for ranking. Each iteration considers the actual performance of the current rule set and directs learning based on the observed search errors. This is in contrast to most prior approaches, which learn control knowledge independently of the search process. Our empirical results have shown significant promise for this approach in a number of domains.

This paper presents a variation of Apriori algorithm that includes the role of domain expert to guide and speed up the overall knowledge discovery task. Usually, the user is interested in finding relationships between certain attributes instead of the whole dataset. Moreover, he can help the mining algorithm to select the target database which in turn takes less time to find the desired association rules. Variants of the standard Apriori and Interactive Apriori algorithms have been run on artificial datasets. The results show that incorporating user's preference in selection of target attribute helps to search the association rules efficiently both in terms of space and time.

A Digital Product Memory provides a digital diary of the complete product life cycle that is embedded in the product itself using smart wireless sensor technology. The data is hereby gathered by recording relevant ambient parameters in digital form. In this paper, we present the architecture and cost-efficient implementation of an autonomous digital product memory that generates and interprets its diary using rule-based reasoning methods. As we assume an open, heterogeneous sensor infrastructure, we rely on standard syntax and semantics provided by the Web Ontology Language OWL. The digital product memory collects and provides data using the OWL fragment OWL2 RL which can be processed with standard rule engines. As rule engine we use CLIPS on embedded hardware and exemplify the application of the digital product memory e.g. for predictive maintenance.

Recently, new approaches to adaptive control have sought to reformulate the problem as a minimization of a relative entropy criterion to obtain tractable solutions. In particular, it has been shown that minimizing the expected deviation from the causal input-output dependencies of the true plant leads to a new promising stochastic control rule called the Bayesian control rule. This work proves the convergence of the Bayesian control rule under two sufficient assumptions: boundedness, which is an ergodicity condition; and consistency, which is an instantiation of the sure-thing principle.

Preface This is a companion paper to Conscious Intelligent Systems Part 1 by the same author (1), which discusses a possible evolutionary path for consciousness and intelligence from simple systems to human level consciousness and intelligence. Man has long been held to be a thinking animal, his thought processes have been held to be the reason for his superiority over the animals. The grand aim of AI has always been to make an entity that can think. Turing took up this very question in his paper (2) on whether machines can think. On the more prosaic roads that real AI has been forced to follow, such grand questions have almost died down. Another major trigger for the demise has been Searle's Chinese Room (3) parody . With this rather cunning device, Searle set the cat among the pigeons and has helped induce self-doubt in the best of AI theorists. One of the major triggers towards Searle's views was language, whether syntax suffices for semantics and therefore understanding. From our evolutionary learning system perspective, which we discuss in Part I of this discussion, we see that all these processes are tied together, the processes of consciousness, intelligence, mind, thought, and language. In a bid to show the interconnectedness of these factors, we take up the question of understanding and its communication. Similar to our treatment of the subject of consciousness based intelligent systems in Part 1, here we treat understanding from first principles. Understanding In the real world when we use the term understanding, it has two main attributes; one is the capacity to infer, the other is the capacity to recognize or discern. In computing and AI contexts the word understanding is arguably tilted more in favor of inference than perception or cognition, in normal life and in the natural kingdom the reverse is true. This is primarily because AI's aims and present status look elemental when compared to the entities of the natural world. The other reason is that AI entities find it easier to infer than cognize, which is in itself a reflection of their design sources and its aims. For the purposes of this discussion the term understanding implies the natural version, a mix of cognition and inference. If we start from first principles, it is clear that for a rule to emerge out of a set of raw data, an inferential process has to run on it. This process could be a formal inferential process or a process that is driven by the needs of economy or efficiency. Rules need not always rise out of intentional activity, for instance the interaction of water flowing from an open tap into a pot already full of water can create a set of rules that disallow further water entry, limit mixing and regulate overflow, many natural rules rise from interactions like these.

Outsourcing of complex IT infrastructure to IT service providers has increased substantially during the past years. IT service providers must be able to fulfil their service-quality commitments based upon predefined Service Level Agreements (SLAs) with the service customer. They need to manage, execute and maintain thousands of SLAs for different customers and different types of services, which needs new levels of flexibility and automation not available with the current technology. The complexity of contractual logic in SLAs requires new forms of knowledge representation to automatically draw inferences and execute contractual agreements. A logic-based approach provides several advantages including automated rule chaining allowing for compact knowledge representation as well as flexibility to adapt to rapidly changing business requirements. We suggest adequate logical formalisms for representation and enforcement of SLA rules and describe a proof-of-concept implementation. The article describes selected formalisms of the ContractLog KR and their adequacy for automated SLA management and presents results of experiments to demonstrate flexibility and scalability of the approach.