In the paper the experimental study of the influence of parameters on the final results of the rule extraction method from neural network for classification problem is described. The method is based on evolutionary ap...
详细信息
ISBN:
(纸本)0769522866
In the paper the experimental study of the influence of parameters on the final results of the rule extraction method from neural network for classification problem is described. The method is based on evolutionary approach, where for each class evolves separate population. The paper starts on the presentation of the basic concepts of the method Next, the results of experiments are described. They examine the influence of genetic parameters. Then, the parameters that affect the rule extraction efficiency are tested. All experiments are made with using UCI data sets. At the end, some general conclusion concerning the role of the parameters and their influence on the final results are formulated.
In this paper we explore abduction over the Herbrand domain - equations on the algebra of finite terms (or finite trees) - which is a central element of logic programming and first-order automated reasoning. This pape...
详细信息
ISBN:
(纸本)0769522661
In this paper we explore abduction over the Herbrand domain - equations on the algebra of finite terms (or finite trees) - which is a central element of logic programming and first-order automated reasoning. This paper is a case study of constraint abduction in the Herbrand domain. The direct relationship between Herbrand constraint abduction and type inference outlined above should make it easy to interpret the results of this paper in the context of type inference.
The notion of comparative similarity 'X is more similar or closer to Y than to Z' has been investigated in both foundational and applied areas of knowledge representation and reasoning, e.g., in concept format...
详细信息
ISBN:
(纸本)354030553X
The notion of comparative similarity 'X is more similar or closer to Y than to Z' has been investigated in both foundational and applied areas of knowledge representation and reasoning, e.g., in concept formation, similarity- based reasoning and areas of bioinformatics such as protein sequence alignment. In this paper we analyse the computational behaviour of the 'propositional' logic with the binary operator 'closer to a set tau(1) than to a set tau(2)' and nominals interpreted over various classes of distance (or similarity) spaces. In particular, using a reduction to the emptiness problem for certain tree automata, we show that the satisfiability problem for this logic is ExpTime- complete for the classes of all finite symmetric and all finite (possibly non-symmetric) distance spaces. For finite subspaces of the real line (and higher dimensional Euclidean spaces) we prove the undecidability of satisfiability by a reduction of the solvability problem for Diophantine equations. As our closer' operator has the same expressive power as the standard operator > of conditional logic, these results may have interesting implications for conditional logic as well.
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a partial order relation on the program&#...
详细信息
ISBN:
(纸本)3540252363
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a partial order relation on the program's rules can be used to deduce a preference relation on its extended answer sets. In this paper, we propose a "quantitative" preference relation that associates a weight with each rule in a program. Intuitively, these weights define the "cost" of defeating a rule. An extended answer set is preferred if it minimizes the sum of the weights of its defeated rules. We characterize the expressiveness of the resulting semantics and show that it can capture negation as failure. Moreover the semantics can be conveniently extended to sequences of weight preferences, without increasing the expressiveness. We illustrate an application of the approach by showing how it can elegantly express subgraph isomorphic approximation problems, a concept often used in intelligence analysis to find specific regions of interest in a large graph of observed activities.
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark's completion of the program that satisfy the...
详细信息
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark's completion of the program that satisfy the loop formulas. Just as supported sets are a model-theoretic account of completion, "externally supported" sets, defined in this paper, are a model-theoretic counterpart of loop formulas. This reformulation of loop formulas shows that they are related to assumption sets (Sacca and Zaniolo) and to unfounded sets (Van Gelder, Ross and Schlipf;Leone, Rullo and Scarcello), invented many years earlier. Other contributions of this paper includes a simplification of the definition of a loop, extending it to programs with classical negation and infinite programs, and a generalization of the definition of a loop formula.
A logic of Multiple-valued Argumentation LMA was formalized by Takahashi and Sawamura (LMA) on an expressive knowledge representation language, Extended Annotated logic programming (EALP). LMA allows agents to constru...
详细信息
ISBN:
(纸本)354028897X
A logic of Multiple-valued Argumentation LMA was formalized by Takahashi and Sawamura (LMA) on an expressive knowledge representation language, Extended Annotated logic programming (EALP). LMA allows agents to construct arguments under uncertain knowledge and to argue with other agents on uncertain issues in the open networked heterogeneous environment. In this paper, we describe an implementation of LMA (called AASLMA) in which agent communication is realized in C and symbolic argument construction in Prolog. The interface design proper to argumentation is also taken into account in the implementation. This is helpful for us to understand argument processes and results. The versatility of LMA is shown through the implementation and some convincing argument examples that employ various types of multiple-valuedness.
Life-scientific databases can accelerate medicine. However, the diversity among these databases has been a problem for researchers who query these databases. Under this situation, the concept of ontology is expected t...
详细信息
ISBN:
(纸本)0769522637
Life-scientific databases can accelerate medicine. However, the diversity among these databases has been a problem for researchers who query these databases. Under this situation, the concept of ontology is expected to be an important key to aggregate these databases and conceal their diversity. This paper discusses two methods for deriving and describing relationships between life-scientific ontologies in a context of drug discovery. Although an ontology is designed to interrelate a set of terms, it is difficult to interrelate terms in different ontologies using a standard ontology language, OWL. This paper illustrates anew rule-based method for interoperating ontologies. This method will be adaptive to various ontologies on the Web, although it is currently in the first stage of development.
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the underlying programs. Sometimes this information is not sufficient for sol...
详细信息
ISBN:
(纸本)3540252363
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the underlying programs. Sometimes this information is not sufficient for solving a certain problem. In this paper we define graphs which are suitable for computing answer sets of logic programs. Intuitively, a graph associated to a logic program is suitable for answer set semantics if its structure is sufficient to compute the answer sets of the corresponding program. We identify different classes of graphs to be suitable for different classes of programs. We also give first experimental results showing the impact of the used graph type to one particular graph based algorithm for answer set computation.
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intui...
详细信息
ISBN:
(纸本)0769523366
In this paper we present a many-valued logic programming, based on reinterpreted Belnap's 4-valued bilattice: we introduce the new semantics for a 4-valued implication by relative pseudo-complement, used for intuitionistic logics. This kind of logic programming is particularly useful for data integration with possibly incomplete and inconsistent information. We define an ontological encapsulation of the epistemic many-valued logic programs with negation, based on this bilattice, into 2-valued meta logic programs. Obtained 2-valued logic semantically reflects original epistemic many-valued logic, and can be used in order to define many-valued logic entailment and inference closure for many-valued truth assignments.
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. We develop a partial order reduction algorithm for rule-based languages such as Murphi [4] based on the observa...
详细信息
ISBN:
(纸本)3540291059
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. We develop a partial order reduction algorithm for rule-based languages such as Murphi [4] based on the observation that for finite-state systems, independence conditions used for PO reduction can be encoded as boolean propositions and checked using SAT methods. Comparisons against static-analysis based PO reduction algorithms have yielded encouraging results.
暂无评论