In this paper we discuss some issues related to the intuitions of defeasible reasoning. Defeasible logic serves as the formal basis for our analysis. We also make some comments on the comparison between defeasible log...
详细信息
ISBN:
(纸本)3540219374
In this paper we discuss some issues related to the intuitions of defeasible reasoning. Defeasible logic serves as the formal basis for our analysis. We also make some comments on the comparison between defeasible logics and the well-founded semantics of extended logic programs with priorities.
This paper is devoted to the mathematical analysis and the numerical solution of data-driven optimization for an important class of fuzzy controllers, so-called Sugeno controllers. In contrast to other approaches whic...
详细信息
ISBN:
(纸本)0780383532
This paper is devoted to the mathematical analysis and the numerical solution of data-driven optimization for an important class of fuzzy controllers, so-called Sugeno controllers. In contrast to other approaches which optimize the underlying fuzzy sets, we will mainly focus on the linear approximation of the output variable according to the input data. While the first approach leads to nonlinear problems, the latter will result in a free, linear least squares system to be solved. Therefore this approach can be used for high dimensional problems as well, when due to the increasing complexity nonlinear systems are no longer applicable. By applying Tikhonov regularization we get stable and fast algorithms that create sufficiently optimized controllers;with saving their interpretability. Finally we will show, how variable selection can be used to increase interpretability and to reduce computation time.
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex constraint program. We study programs that solve tabular-constraint problems encod...
详细信息
ISBN:
(纸本)1932415335
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex constraint program. We study programs that solve tabular-constraint problems encoded in Constraint Lingo and then translated into propositional logic with cardinality constraints. We instrument the logic solver so that it generates log files. We inspect those logs and express reasoning steps in English by using grammatical information placed in the Constraint Lingo program.
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional logic programming, but under a completely different semantic perspective. Our starting po...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional logic programming, but under a completely different semantic perspective. Our starting point comes from the use of logic programs for Knowledge Representation and Nonmonotonic Reasoning, especially under three well-known semantics for default negation: Clark's completion, stable models and well-founded semantics. The motivation for introducing functions in this setting arises from the frequent occurrence of functional dependences in the representation of many domains. The use of functions allows us to avoid explicit axiomatization and provides a more compact representation by nesting functional terms. From a representational point of view, the most interesting introduced feature is the possibility of replacing default negation by the concept of default value of a function. In the paper, we explore this idea of functions with default values, providing adapted versions of the three mentioned semantics for the functional case, and equivalent translations into logic programs.
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been given to temporal logics of knowledge, alt...
详细信息
ISBN:
(纸本)0262511835
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been given to temporal logics of knowledge, although such logics have been proven to be very useful in the specifications of protocols for distributed systems. In this paper, we address ourselves to the model checking problem for a temporal logic of knowledge (Halpern and Vardi's logic of CKLn). Based on the semantics of interpreted systems with local propositions, we develop an approach to symbolic CKLn model checking via OBDDs. In our approach to model checking specifications involving agents' knowledge, the knowledge modalities are eliminated via quantifiers over agents' non-observable variables.
In this paper we propose a new way to represent P systems with active membranes based on logic programming techniques. This representation allows us to express the set of rules and the configuration of the P system in...
详细信息
In this paper we propose a new way to represent P systems with active membranes based on logic programming techniques. This representation allows us to express the set of rules and the configuration of the P system in each step of the evolution as literals of an appropriate language of first order logic. We provide a Prolog program to simulate the evolution of these P systems and present some auxiliary tools to simulate the evolution of a, P system with active membranes using 2-division which solves the SAT problem following the techniqnes presented in Reference.
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest. a...
详细信息
This paper presents the first scalable context-sensitive, inclusion-based pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a method for every context of interest. and run a context-insensitive algorithm over the expanded call graph to get context-sensitive results. For precision, we generate a clone for every acyclic path through a program's call graph, treating methods in a strongly connected component as a single node. Normally, this formulation is hopelessly intractable as a call graph often has 10(14) acyclic paths or more. We show that these exponential relations can be computed efficiently using binary decision diagrams (BDDs). Key to the scalability of the technique is a context numbering scheme that exposes the commonalities across contexts. We applied our algorithm to the most popular applications available on Sourceforge, and found that the largest programs, with hundreds of thousands of Java bytecodes, can be analyzed in under 20 minutes. This paper shows that pointer analysis, and many other queries and algorithms, can be described succinctly and declaratively using Datalog, a logic programming language. We have developed a system called bddbddb that automatically translates Datalog programs into highly efficient BDD implementations. We used this approach to develop a variety of context-sensitive algorithms including side effect analysis, type analysis, and escape analysis.
Our electrical and computer engineering students at Northern Arizona University often have difficulty successfully applying their digital logic skills to subsequent courses. Colleagues at other universities have expre...
详细信息
This paper provides a new departure from the traditional two-valued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a logic of Multiple-valued Argumentation (LM...
详细信息
ISBN:
(纸本)1581138644
This paper provides a new departure from the traditional two-valued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated logic programming (EALP), and examine its logical properties in various ways. EALP allows us to represent different kinds of uncertainty such as vagueness and inconsistency (orparaconsistency) in terms of multi-valuedness, and incompleteness with the help of default negation. LMA is a full-dress logic of argumentation in which agents can argue with other contenders, using multiple-valued knowledge base in terms of EALP.
We address the problem of proving total correctness of transformation rules for definite logic programs. We consider a general transformation rule, called clause replacement, which consists in transforming a program P...
详细信息
ISBN:
(纸本)9781581138351
We address the problem of proving total correctness of transformation rules for definite logic programs. We consider a general transformation rule, called clause replacement, which consists in transforming a program P into a new program Q by replacing a set Γ1 of clauses occurring in P by a new set Γ2 of clauses, provided that Γ1 and Γ2 are equivalent in the least Herbrand model M (P) of the program P. We propose a general method for proving that clause replacement is totally correct, that is, M (P) = M (Q). Our method consists in showing that the transformation of P into Q can be performed by: (i) adding extra arguments to predicates, thereby constructing from the given program P an annotated program α (P), (ii) applying clause replacements and transforming the annotated program α (P) into a terminating annotated program β(Q), and (iii) erasing the annotations from β(Q), thereby getting Q. Our method does not require that either P or Q terminates and it is parametric w.r.t. the annotations. By providing different definitions for these annotations, we can easily prove the total correctness of many versions of the unfolding, folding, and goal replacement rules proposed in the literature.
暂无评论