An Investigation of the Cost and Accuracy Tradeoffs of Supplanting... in Query Processing in the Presence of Incompleteness in Autonomous...

... more and more information in autonomous databases. Incompleteness in these autonomous sources is extremely commonplace. Such incompleteness mainly arises due to the way in which these databases are populated- through (inaccurate) automatic extraction or by lay users. Dealing with incompleteness in t ...

... more and more information in autonomous databases. Incompleteness in these autonomous sources is extremely commonplace. Such incompleteness mainly arises due to the way in which these databases are populated- through (inaccurate) automatic extraction or by lay users. Dealing with incompleteness in t ...

RIGID E-UNIFICATION

... closely related to the number of choice points when rigid E-unification is used for a deduction step. Therefore, it is desirable to compute a minimal complete set of unifiers. Nevertheless, it is often not useful to ensure minimality since there is a trade-off between the gain of computing a minimal ...

... closely related to the number of choice points when rigid E-unification is used for a deduction step. Therefore, it is desirable to compute a minimal complete set of unifiers. Nevertheless, it is often not useful to ensure minimality since there is a trade-off between the gain of computing a minimal ...

Algorithms for Maximum Satisfiability

... [Morgado, Liffiton, and Marques-Silva, 2012] heuristics for cost-optimal planning [Zhang and Bacchus, 2012] ...

... [Morgado, Liffiton, and Marques-Silva, 2012] heuristics for cost-optimal planning [Zhang and Bacchus, 2012] ...

FS-FOIL: An Inductive Learning Method for Extracting Interpretable

... use equally sized fuzzy intervals (triangular fuzzy numbers or trapezoids). Secondly, an uneven distribution can be defined manually in case that there is specific knowledge about the particular attribute available. Thirdly, it is possible to use a clustering technique to generate unevenly distribut ...

... use equally sized fuzzy intervals (triangular fuzzy numbers or trapezoids). Secondly, an uneven distribution can be defined manually in case that there is specific knowledge about the particular attribute available. Thirdly, it is possible to use a clustering technique to generate unevenly distribut ...

questions and answers: reasoning and querying in description logic

... This individual is described as a bird which cannot fly, having at least one friend which is a flyer. Partitioning knowledge in this way is quite a common methodology in computer science. For instance, in the database setting the distinction between schemata and an actual database could be seen as t ...

... This individual is described as a bird which cannot fly, having at least one friend which is a flyer. Partitioning knowledge in this way is quite a common methodology in computer science. For instance, in the database setting the distinction between schemata and an actual database could be seen as t ...

Subspace Clustering, Ensemble Clustering, Alternative Clustering

... over the complete data space. The geometrical intuition of these assumptions relates to the points of a cluster being widely scattered in the direction of irrelevant axes while being densely clustered along relevant attributes. When selecting the relevant attributes only, the cluster would appear as ...

... over the complete data space. The geometrical intuition of these assumptions relates to the points of a cluster being widely scattered in the direction of irrelevant axes while being densely clustered along relevant attributes. When selecting the relevant attributes only, the cluster would appear as ...

On Rule Interestingness Measures.

... measures, as follows. 1) RI = 0 if |A & B| = |A| |B| / N. 2) RI monotonically increases with |A&B| when other parameters are fixed. 3) RI monotonically decreases with |A| or |B| when other parameters are fixed. The first principle says that the RI measure is zero if the antecedent and the consequen ...

... measures, as follows. 1) RI = 0 if |A & B| = |A| |B| / N. 2) RI monotonically increases with |A&B| when other parameters are fixed. 3) RI monotonically decreases with |A| or |B| when other parameters are fixed. The first principle says that the RI measure is zero if the antecedent and the consequen ...

Introduction to Artificial Intelligence (Undergraduate Topics in

... costly for most students, the requirements for writing this book were clear: it should be an accessible introduction to modern AI for self-study or as the foundation of a four-hour lecture, with at most 300 pages. The result is in front of you. In the space of 300 pages, a field as extensive as AI c ...

... costly for most students, the requirements for writing this book were clear: it should be an accessible introduction to modern AI for self-study or as the foundation of a four-hour lecture, with at most 300 pages. The result is in front of you. In the space of 300 pages, a field as extensive as AI c ...

Assessing Conceptual Similarity to Support Concept Mapping б г д

... Concept maps capture knowledge about the concepts and concept relationships in a domain, using a two-dimensional visually-based representation. Computer tools for concept mapping empower experts to directly construct, navigate, share, and criticize rich knowledge models. This paper describes ongoing ...

... Concept maps capture knowledge about the concepts and concept relationships in a domain, using a two-dimensional visually-based representation. Computer tools for concept mapping empower experts to directly construct, navigate, share, and criticize rich knowledge models. This paper describes ongoing ...

The Quest for Efficient Boolean Satisfiability Solvers | SpringerLink

... For the efficiency of the solver, the propositional formula instance is usually presented in a Product of Sum form, usually called a Conjunctive Normal Form (CNF). It is not a limitation to require the instance to be presented in CNF. There exist polynomial algorithms (e.g. [24]) to transform any pr ...

... For the efficiency of the solver, the propositional formula instance is usually presented in a Product of Sum form, usually called a Conjunctive Normal Form (CNF). It is not a limitation to require the instance to be presented in CNF. There exist polynomial algorithms (e.g. [24]) to transform any pr ...

Schematic Invariants by Reduction to Ground Invariants

... typed schematic language for expressing actions and invariants.1 Definition 1 (Types) Let O be a set of objects. Let there be a finite set T of types, and to each type t ∈ T a non-empty set D(t) ⊆ O of objects is associated by the domain function D : T → O. The objects of different types do not need ...

... typed schematic language for expressing actions and invariants.1 Definition 1 (Types) Let O be a set of objects. Let there be a finite set T of types, and to each type t ∈ T a non-empty set D(t) ⊆ O of objects is associated by the domain function D : T → O. The objects of different types do not need ...

A Partial Taxonomy of Substitutability and Interchangeability

... Basic Interchangeability Concepts ...

... Basic Interchangeability Concepts ...

Compositional Belief Update

... without giving any a priori preference to one or the other of the belief sets, but aiming to achieve a balanced resolution of conﬂicts. Such a merging might be used to combine the belief states of diﬀerent agents, so as to come up with a joint course of action based on some sort of “all things consi ...

... without giving any a priori preference to one or the other of the belief sets, but aiming to achieve a balanced resolution of conﬂicts. Such a merging might be used to combine the belief states of diﬀerent agents, so as to come up with a joint course of action based on some sort of “all things consi ...

Knowledge Representation and Classical Logic

... entail (p ∨ q) → r is justified by Figure 1.2. As a matter of convenience, informal summaries, as in the example above, can be used instead of formal proofs. Since the system is not only sound but also complete, the object-level approach to establishing entailment is, in principle, always applicable ...

... entail (p ∨ q) → r is justified by Figure 1.2. As a matter of convenience, informal summaries, as in the example above, can be used instead of formal proofs. Since the system is not only sound but also complete, the object-level approach to establishing entailment is, in principle, always applicable ...

... entail (p ∨ q) → r is justified by Figure 1.2. As a matter of convenience, informal summaries, as in the example above, can be used instead of formal proofs. Since the system is not only sound but also complete, the object-level approach to establishing entailment is, in principle, always applicable ...

Applying Model-Checking to solve Queries on Semistructured Data

... graph-equivalence relations are graph isomorphism and graph bisimulation. Isomorphism is a syntactic notion and there are neither polynomial time algorithms for the Subgraph Isomorphism problem (NP-complete) nor for the Graph Isomorphism problem (which is in NP but currently it is not known whether ...

... graph-equivalence relations are graph isomorphism and graph bisimulation. Isomorphism is a syntactic notion and there are neither polynomial time algorithms for the Subgraph Isomorphism problem (NP-complete) nor for the Graph Isomorphism problem (which is in NP but currently it is not known whether ...

KRR Lectures — Contents

... Inference and Computation A tough issue that any AI reasoning system must confront is that of Tractability. A problem domain is intractable if it is not possible for a (conventional) computer program to solve it in ‘reasonable’ time (and with ‘reasonable’ use of other resources such as memory). Cer ...

... Inference and Computation A tough issue that any AI reasoning system must confront is that of Tractability. A problem domain is intractable if it is not possible for a (conventional) computer program to solve it in ‘reasonable’ time (and with ‘reasonable’ use of other resources such as memory). Cer ...

A theoretical study of Y structures for causal discovery

... Furthermore, it is known that members of an independence (Markov) equivalence class of causal Bayesian network (CBN) models are indistinguishable using only probabilistic dependence and independence relationships among the observed variables. There are several algorithms for reliably identifying (so ...

... Furthermore, it is known that members of an independence (Markov) equivalence class of causal Bayesian network (CBN) models are indistinguishable using only probabilistic dependence and independence relationships among the observed variables. There are several algorithms for reliably identifying (so ...

Applications of MaxSAT in Automotive Configuration - CEUR

... to be satisfied (e.g. it is not possible to configure a car with more than one steering wheel). Second, it is possible that the dependencies between components do not necessarily have to be satisfied (e.g. a dependency could have been created due to marketing reasons; “No black seats for all Japanes ...

... to be satisfied (e.g. it is not possible to configure a car with more than one steering wheel). Second, it is possible that the dependencies between components do not necessarily have to be satisfied (e.g. a dependency could have been created due to marketing reasons; “No black seats for all Japanes ...

A Hennessy-Milner Property for Many

... mostly on issues of axiomatization, decidability, and complexity. Other topics from the rich theory of modal logics, such as first-order correspondence theory, canonical models, etc. have not as yet received much attention. In particular, the general question of the expressivity of many-valued modal ...

... mostly on issues of axiomatization, decidability, and complexity. Other topics from the rich theory of modal logics, such as first-order correspondence theory, canonical models, etc. have not as yet received much attention. In particular, the general question of the expressivity of many-valued modal ...

Agents that look at one another

... that agents know all the logical consequences of their knowledge. This is the so-called logical omniscience character of agents. For more on the various problems associated with it, see [20, 21]. Secondly, we will require that the visual capacity of agents satisfies the following conditions: agents ...

... that agents know all the logical consequences of their knowledge. This is the so-called logical omniscience character of agents. For more on the various problems associated with it, see [20, 21]. Secondly, we will require that the visual capacity of agents satisfies the following conditions: agents ...

Research and Development of Granular Neural Networks

... different types of constraints, one can get a variety of granularity. From the simple granularity, we can also get the Descartes product of granularity by the combination of the constraints. Zadeh’s model has laid the basis for the theory of computing with words. Fuzzy i f − then rules can be formal ...

... different types of constraints, one can get a variety of granularity. From the simple granularity, we can also get the Descartes product of granularity by the combination of the constraints. Zadeh’s model has laid the basis for the theory of computing with words. Fuzzy i f − then rules can be formal ...

Document

... Information is the life blood of modern society. Decisions are based on information. More often than not, decision-relevant information is imperfect in the sense that it is in part imprecise and/or uncertain and/or incomplete and/or conflicting and/or partially true. There is a long list of methods ...

... Information is the life blood of modern society. Decisions are based on information. More often than not, decision-relevant information is imperfect in the sense that it is in part imprecise and/or uncertain and/or incomplete and/or conflicting and/or partially true. There is a long list of methods ...

Disproving False Conjectures

... logic without successor functions, S0S [8]. The abstraction function is effectively polynomial-time computable, preserves the structural form of the original formula, and most importantly preserves non-provability. Second-order monadic logic is decidable, and therefore disproving a conjecture in S0S ...

... logic without successor functions, S0S [8]. The abstraction function is effectively polynomial-time computable, preserves the structural form of the original formula, and most importantly preserves non-provability. Second-order monadic logic is decidable, and therefore disproving a conjecture in S0S ...

The Rise of Granular Computing - University of Regina

... intelligence [14]. Although intelligent machines may be physically implemented different from brains, an understanding of the working principles of the brain is a prerequisite and indispensable for designing intelligent machines. Therefore, we need to have a unified framework of cognitive systems, i ...

... intelligence [14]. Although intelligent machines may be physically implemented different from brains, an understanding of the working principles of the brain is a prerequisite and indispensable for designing intelligent machines. Therefore, we need to have a unified framework of cognitive systems, i ...

Granular computing (GrC) is an emerging computing paradigm of information processing. It concerns the processing of complex information entities called information granules, which arise in the process of data abstraction and derivation of knowledge from information or data. Generally speaking, information granules are collections of entities that usually originate at the numeric level and are arranged together due to their similarity, functional or physical adjacency, indistinguishability, coherency, or the like.At present, granular computing is more a theoretical perspective than a coherent set of methods or principles. As a theoretical perspective, it encourages an approach to data that recognizes and exploits the knowledge present in data at various levels of resolution or scales. In this sense, it encompasses all methods which provide flexibility and adaptability in the resolution at which knowledge or information is extracted and represented.