the emerging technologies of soft computing promise to solve many real-world problems which are difficult to tackle using conventional approaches. Fril combines soft computing and logicprogramming into an AI language...
详细信息
ISBN:
(纸本)0780324617
the emerging technologies of soft computing promise to solve many real-world problems which are difficult to tackle using conventional approaches. Fril combines soft computing and logicprogramming into an AI language with powerful and flexible features for handling uncertainty. In this paper we outline a Fril implementation of the fuzzy data browser, which can generate rules describing the relationships underlying large tables of data. these rules can be used to summarise data for humans, predict missing values, search for anomalous values, etc. A fuzzy object-oriented architecture is described, which permits objects to be members (to a degree) of several classes, and to combine inherited values from those classes using fuzzy techniques.
We illustrate the use of a declarative programming paradigm based upon three kinds of program clauses: equational, subset, and general relational clauses. the implemented language is called SURE, which is an acronym f...
详细信息
A lot of Prologs applied fuzzy theory, so called Fuzzy Prolog, have been studied since Zadeh has proposed fuzzy theory. Although various approaches of Fuzzy Prolog were proposed until now, there was no common interpre...
详细信息
ISBN:
(纸本)0780324625
A lot of Prologs applied fuzzy theory, so called Fuzzy Prolog, have been studied since Zadeh has proposed fuzzy theory. Although various approaches of Fuzzy Prolog were proposed until now, there was no common interpretation for fuzzifying Prolog. In [8], from the user's side we considered what Fuzzy Prolog have to be able to do and proposed some approaches for fuzzifying Prolog which satisfy user's postulates. LbFP is Fuzzy Prolog which is based on these proposals and adopts Lukasiewicz's for implication operation and bounded product for combination operation. In this paper, at first we introduce what Fuzzy Prolog have to be able to do by using some examples. Next we explain some definitions and theorems for fuzzy logicprogramming which adopts Lukasiewicz's for implication operation and bounded product for combination operation. Finally, we show the implementation of LbFP.
According to rumors, the early hybrids of object-oriented and deductive languages were mutants that escaped from secret Government AI labs. Whether this is true or not, the fact is that by mid-80’s, database and logi...
详细信息
ISBN:
(纸本)9783540606086
According to rumors, the early hybrids of object-oriented and deductive languages were mutants that escaped from secret Government AI labs. Whether this is true or not, the fact is that by mid-80’s, database and logicprogramming communities began to take notice. the temptation was hard to resist: the object-oriented paradigm provides a better way of manipulating structured objects, while logic and deduction offer the power and flexibility of ad hoc querying and reasoning. thus, hybrid languages have the potential for becoming an ideal turf for cultivating the next generation of information systems. the approaches to integration of the two paradigms range from logic-based languages with unified declarative semantics, to message-passing prologs, to Prolog/C++ cocktails. In the past eight years, my colleagues and I have been developing a unified object-based logic intended to capture most of the essentials of the object-oriented paradigm. the overall plot here is that once the fundamentals are in place, the actual hybrid programming languages can be carved out of the logicthe same way as deductive data languages have been carved out of the classical logic. there are two distinct aspects in object-orientation: structural (the statics) and procedural (the dynamics). the static aspect was somewhat easier to capture in logic and after taking a few wrong turns F-logic was developed [17]. Taming the dynamics was harder, because there was no widely accepted solution to the problem of state changes even for traditional deductive languages. Our recent work on Transaction logic [8, 7] appears to provide an adequate framework for specifying the dynamics in classical deductive languages. this paper first reviews some core aspects of F-logic and Transaction logic, and then shows how the two can be combined in a natural way to yield a unified foundation for future work on deductive object-oriented languages both in theory and practice. At the end, we discuss areas that still remai
Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. One shortcoming of (standard) temporal logic is that it is inadequate for real-time applications, b...
详细信息
this paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. the logic is shown to be sound, complete and decidable. Moreover, it is illustrate...
详细信息
this paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, ca...
详细信息
We study how to preserve universal termination besides computed answer substitutions while transforming definite programs. We consider the unfold operation both alone and combined withthe introduction of a new defini...
详细信息
We describe LC, a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler ope...
详细信息
the proceedings contain 22 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logi...
ISBN:
(纸本)9783540580256
the proceedings contain 22 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logic programs;finite domains and exclusions as first-class citizens;some experimental results in implementing a logic language with multi-head clauses on a transputer architecture;a language with finite sets embedded in the CLP-scheme;finitary partial inductive definitions as a general logic;programming methodologies in GCLA;computing cost estimates for proof strategies;logicprogramming with multiple context management schemes;non-procedural logicprogramming;axioms in definitional calculi;regular search spaces as a foundation of logicprogramming;answer sets and nonmonotonic s4;cut formulae and logicprogramming;higher-order aspects of logicprogramming;representation and inference with consistent temporal propositions;definitional reflection and the completion.
暂无评论