DSTO-TR-2324 PR
... As part of the information fusion task we wish to automatically fuse information derived from the text extraction process with data from a structured knowledge base. This process will involve resolving, aggregating, integrating and abstracting information - via the methodologies of Knowledge Represe ...
... As part of the information fusion task we wish to automatically fuse information derived from the text extraction process with data from a structured knowledge base. This process will involve resolving, aggregating, integrating and abstracting information - via the methodologies of Knowledge Represe ...
Approximating propositional knowledge with affine formulas
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
Positive and Negative Results for Higher
... framework. This step consists in checking that a case denition à la ML, like above, handles all possibilities and that there is no missing case. This is a run of the mill check in functional language like ML, but the problem is much more complicated for higher-order algebraic languages since the de ...
... framework. This step consists in checking that a case denition à la ML, like above, handles all possibilities and that there is no missing case. This is a run of the mill check in functional language like ML, but the problem is much more complicated for higher-order algebraic languages since the de ...
X is A - Wiki Index
... information= capability to compute with information described in a natural language= NL-capability. ...
... information= capability to compute with information described in a natural language= NL-capability. ...
full paper - Frontiers in Artificial Intelligence and Applications (FAIA)
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
... Not many classes of formulas satisfy these requirements. Horn formulas are often considered for approximating knowledge (see for instance [10]), but they have some limits : e.g., the shortest Horn approximation of a knowledge base may be exponentially larger than its set of models, and some problems ...
Exploiting Past and Future: Pruning by Inconsistent Partial State
... partial snapshot of the current state (a set of meaningful variables and their associated domains) is recorded, in order to avoid a similar situation to occur later during search. To make this approach quite successful, two important issues must be addressed: limiting the space memory required, and ...
... partial snapshot of the current state (a set of meaningful variables and their associated domains) is recorded, in order to avoid a similar situation to occur later during search. To make this approach quite successful, two important issues must be addressed: limiting the space memory required, and ...
Artificial Intelligence Experimental results on the crossover point in
... Further, many commercially important problems in scheduling, configuration, and planning also appear to be instances of NP-complete problems. The best-known algorithms for solving such problems are known to require exponential run time (in the size of the problem) in the worst case. However, a worst ...
... Further, many commercially important problems in scheduling, configuration, and planning also appear to be instances of NP-complete problems. The best-known algorithms for solving such problems are known to require exponential run time (in the size of the problem) in the worst case. However, a worst ...
Feature selection and extraction
... it better to know that the black king is at D1 while white queen at H4, or is it better to know that the white queen threatens the black king? ...
... it better to know that the black king is at D1 while white queen at H4, or is it better to know that the white queen threatens the black king? ...
Computability and Complexity Results for a Spatial Assertion
... Note that the theorem uses an intuitionistic variant → of the predicate → because only with the → predicate, we can not express that a heap cell l is allocated and contains (v1 , v2 ) without requiring that l is the only allocated heap cell. The meaning of (E → E1 , E2 ) is that a heap cell E is ...
... Note that the theorem uses an intuitionistic variant → of the predicate → because only with the → predicate, we can not express that a heap cell l is allocated and contains (v1 , v2 ) without requiring that l is the only allocated heap cell. The meaning of (E → E1 , E2 ) is that a heap cell E is ...
Induction of decision trees
... u n c o m m o n cases that have not been encountered during the period of recordkeeping. On the other hand, the objects might be a carefully culled set of tutorial examples prepared by a domain expert, each with some particular relevance to a complete and correct classification rule. The expert migh ...
... u n c o m m o n cases that have not been encountered during the period of recordkeeping. On the other hand, the objects might be a carefully culled set of tutorial examples prepared by a domain expert, each with some particular relevance to a complete and correct classification rule. The expert migh ...
An Active Approach to Characterizing Dynamic Dependencies
... » but could do so by adding synthetic test requests? » ideal is to build a basis for the whole-system dependency matrix Slide 20 ...
... » but could do so by adding synthetic test requests? » ideal is to build a basis for the whole-system dependency matrix Slide 20 ...
First-Order Extension of the FLP Stable Model
... semantics proposed by Ferraris, Lee and Lifschitz, the semantics proposed here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semant ...
... semantics proposed by Ferraris, Lee and Lifschitz, the semantics proposed here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the first-order stable model semant ...
PDF
... allow variable assignments that are inconsistent. The variable states for backtrack search identified previously in Figure 1 are insufficient. We require a distinction be made in Figure 1 between variables assigned maximal values and those remaining assigned variables which can choose (potentially) ...
... allow variable assignments that are inconsistent. The variable states for backtrack search identified previously in Figure 1 are insufficient. We require a distinction be made in Figure 1 between variables assigned maximal values and those remaining assigned variables which can choose (potentially) ...
LUDI: A Model for Geometric Analogies using Attribute Matching
... completely different. In contrast, LUDI knows that A and B contain the same objects - the same labels being applied in A and B (see figure 1). This new information, which is a new description of the input figures, is then passed along to part two. This new information is used to attempt to construct ...
... completely different. In contrast, LUDI knows that A and B contain the same objects - the same labels being applied in A and B (see figure 1). This new information, which is a new description of the input figures, is then passed along to part two. This new information is used to attempt to construct ...
Modular Basic Action Theories - Department of Computer Science
... Hayes 1969) but wasn’t defined there. (McCarthy 1986) proposed to solve the frame and qualification problems by circumscription, but the proposed solution to the frame problem was incorrect. (Shanahan 1997) and (Reiter 2001) describe several situation calculus formalisms and give references” (see th ...
... Hayes 1969) but wasn’t defined there. (McCarthy 1986) proposed to solve the frame and qualification problems by circumscription, but the proposed solution to the frame problem was incorrect. (Shanahan 1997) and (Reiter 2001) describe several situation calculus formalisms and give references” (see th ...
Rough set approach to knowledge
... the core belongs to some reduct. Thus, in a sense, the core is the most important subset of attributes, for none of its elements can be removed without affecting the classification power of attributes. Complexity of computing all reducts in an information system is rather high. However, in many appl ...
... the core belongs to some reduct. Thus, in a sense, the core is the most important subset of attributes, for none of its elements can be removed without affecting the classification power of attributes. Complexity of computing all reducts in an information system is rather high. However, in many appl ...
Constructing a Fuzzy Decision Tree by Integrating Fuzzy Sets and
... expressing mapping from attribute values to classes and consists of tests or attribute nodes linked to two or more subtrees and leafs or decision nodes labeled with a class which indicates the decision. The main advantage of decision-tree approach is it visualizes the solution; it is easy to follow ...
... expressing mapping from attribute values to classes and consists of tests or attribute nodes linked to two or more subtrees and leafs or decision nodes labeled with a class which indicates the decision. The main advantage of decision-tree approach is it visualizes the solution; it is easy to follow ...
Identifying and Overcoming Common Data Mining Mistakes
... varies greatly across the range of the input values. The points in the tails of their distributions can have a great impact on the fitted model. Because most predictions aren’t being made at these extreme values, the resulting model fit can be suboptimal for many predictor values of interest. This p ...
... varies greatly across the range of the input values. The points in the tails of their distributions can have a great impact on the fitted model. Because most predictions aren’t being made at these extreme values, the resulting model fit can be suboptimal for many predictor values of interest. This p ...
Robotics, Temporal Logic and Stream Reasoning
... are covered elsewhere [7], but are the basis for supporting the functionalities described here. A related issue of fundamental importance is the principled management of dataflow in such architectures. This issue is often overlooked, but is central to the ability of a system to reason at a high leve ...
... are covered elsewhere [7], but are the basis for supporting the functionalities described here. A related issue of fundamental importance is the principled management of dataflow in such architectures. This issue is often overlooked, but is central to the ability of a system to reason at a high leve ...
Identifying and Overcoming Common Data Mining Mistakes
... varies greatly across the range of the input values. The points in the tails of their distributions can have a great impact on the fitted model. Because most predictions aren’t being made at these extreme values, the resulting model fit can be suboptimal for many predictor values of interest. This p ...
... varies greatly across the range of the input values. The points in the tails of their distributions can have a great impact on the fitted model. Because most predictions aren’t being made at these extreme values, the resulting model fit can be suboptimal for many predictor values of interest. This p ...
Fixed-parameter complexity in AI and nonmonotonic reasoning
... 2P -complete [15]. Note, however, that completeness results for parameterized classes are more difficult to obtain. In fact, for obtaining our completeness result we had to resort to the general version of circumscription (called P ;Z-circumscription) where the propositional letters of the theory t ...
... 2P -complete [15]. Note, however, that completeness results for parameterized classes are more difficult to obtain. In fact, for obtaining our completeness result we had to resort to the general version of circumscription (called P ;Z-circumscription) where the propositional letters of the theory t ...
PDF
... Let -/.102436587:9<;>=@?BA@"+CD-E GF*AH be a truth partial assignment. We use CJIK-.#L to denote the simplified SAT instance obtained from the formula C by setting the variables defined in /- . , i.e., by fixing the truth values of the variables in -/. . A set of backdoor variables is defined wit ...
... Let -/.102436587:9<;>=@?BA@"+CD-E GF*AH be a truth partial assignment. We use CJIK-.#L to denote the simplified SAT instance obtained from the formula C by setting the variables defined in /- . , i.e., by fixing the truth values of the variables in -/. . A set of backdoor variables is defined wit ...
Getting More Out of the Exposed Structure in Constraint
... the whole structure of the solution set of a constraint, we can take more or less insightful peeks at the structure depending on the nature of our queries. Variable domains are the very flat projections of that distribution on each individual variable. Here are a couple of more revealing ideas. Lear ...
... the whole structure of the solution set of a constraint, we can take more or less insightful peeks at the structure depending on the nature of our queries. Variable domains are the very flat projections of that distribution on each individual variable. Here are a couple of more revealing ideas. Lear ...
Presentation - Kuwait Anesthesia & Critical Care Council
... ■ Decreases oncotic gradient across bowel wall ■ May be due to malnutrition, stress, fluid overload ○ Edematous bowel ■ Patient with anasarca likely has edema of the bowel also ■ Diarrhea often improves with fluid removal such as continuous dialysis ...
... ■ Decreases oncotic gradient across bowel wall ■ May be due to malnutrition, stress, fluid overload ○ Edematous bowel ■ Patient with anasarca likely has edema of the bowel also ■ Diarrhea often improves with fluid removal such as continuous dialysis ...
Data Mining Discretization Methods and Performances (PDF
... performances of various discretization methods on several domain areas. The experiments have been validated using 10fold cross validation method. The ranking of the performances of the methods have been discovered from the experiments. The results suggest that different discretization methods perfor ...
... performances of various discretization methods on several domain areas. The experiments have been validated using 10fold cross validation method. The ranking of the performances of the methods have been discovered from the experiments. The results suggest that different discretization methods perfor ...
Granular computing
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.