We use the formal model for similarity-based fuzzy unification in multi-adjoint logic programs to provide new tools for flexible querying. Our approach is based on a general framework for logicprogramming, which give...
详细信息
ISBN:
(纸本)3540000747
We use the formal model for similarity-based fuzzy unification in multi-adjoint logic programs to provide new tools for flexible querying. Our approach is based on a general framework for logicprogramming, which gives a formal model of fuzzy logicprogramming extended by fuzzy similarities and axioms of first-order logic with equality. As a source of similarities we consider different approaches, such as statistical generation of fuzzy similarities, or similarities generated by some information retrieval techniques or similarities arising from fuzzy conceptual lattices.
the proceedings contain 26 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: the role of declarative languages in mining biological databases;light and ...
ISBN:
(纸本)3540003894
the proceedings contain 26 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: the role of declarative languages in mining biological databases;light and fast applicative algorithms for computational linguistics;data mining the yeast genome in a lazy functional language;an integrated information system powered by prolog;iterable abstract pattern matching for java;reconstructing the evolutionary history of indo-European languages using answer set programming;logic programs for querying inconsistent databases;a CLP-based tool for computer aided generation and solving of Maths exercises;type-based xml processing in logicprogramming;garbage collection algorithms for java-based prolog engines;solving combinatorial problems with a constraint functional logic language;logic programs as compact denotations and lambda goes to Hollywood.
Withthe recent release of the movie AI, there is interest in artificial intelligence and in just how far we can take computational intelligence. this paper discusses the advances made in the computational intelligenc...
详细信息
ISBN:
(纸本)0819444898
Withthe recent release of the movie AI, there is interest in artificial intelligence and in just how far we can take computational intelligence. this paper discusses the advances made in the computational intelligence arena and brings perspective to what may be possible in the future.
Most of the work conducted so far in the field of logicprogramming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the aut...
详细信息
ISBN:
(纸本)3540667490
Most of the work conducted so far in the field of logicprogramming has focused on representing static knowledge, i.e., knowledge that does not evolve with time. To overcome this limitation, in a recent paper, the authors introduced dynamic logicprogramming. there, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs). Each program in the sequence contains knowledge about some given state, where different states may, for example, represent different time periods or different sets of priorities. But how, in concrete situations, is a sequence of logic programs built? For instance, in the domain of actions, what are the appropriate sequences of programs that represent the performed actions and their effects? Whereas dynamic logicprogramming provides a way for, given the sequence, determining what should follow, it does not provide a good practical language for the specification of the sequence of updates which may be conditional on the intervening states. Here we define the language LUPS-"Language for dynamic updates"-designed for specifying changes to logic programs. Given an initial knowledge base (as a logic program) LUPS provides a way for sequentially updating it. the declarative meaning of a sequence of sets of update actions in LUPS is defined by the semantics of the dynamic logic program generated by those actions. Additionally, we provide a translation of the sequence of update statements sets into a single logic program written in a meta-language, in such a way that the stable models of the resulting program correspond to the previously defined declarative semantics. Finally, we exhibit the usage of LUPS in several application domains. (C) 2002 Elsevier Science B.V. All rights reserved.
For many applications it is desirable to construct expert systems to be used as decision aids. It is often essential that the algorithm make decisions at least at the quality level of the best human experts according ...
详细信息
In a mediator system based on annotated logics it is a suitable requirement to allow annotations from different lattices in one program on a per-predicate basis. these lattices however may be related through common su...
详细信息
ISBN:
(纸本)9783540449904
In a mediator system based on annotated logics it is a suitable requirement to allow annotations from different lattices in one program on a per-predicate basis. these lattices however may be related through common sublattices, hence demanding predicates which are able to carry combinations of annotations, or access to components of annotations. We show both demands to be satisifiable by using various composition operations on the domain of complete bounded distributive lattices or bilattices, most importantly the free distributive product. An implementation of the presented concepts, based on the KOMET implementation of SLG-AL with constraints, is briefly introduced.
Revision programming is a formalism to describe and enforce updates of belief sets and databases. that formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantif...
详细信息
ISBN:
(纸本)3540667490
Revision programming is a formalism to describe and enforce updates of belief sets and databases. that formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence (probability) that a revision atom holds. the main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition, and to propose an alternative treatment of annotated revision programs. Our approach differs from that proposed by Fitting in two key aspects: we change the notion of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the annotated case. (C) 2002 Elsevier Science B.V. All rights reserved.
the proceedings contain 35 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Coordination and system design in a network-centric age;time, knowledge, and coopera...
ISBN:
(纸本)9783540434108
the proceedings contain 35 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Coordination and system design in a network-centric age;time, knowledge, and cooperation;alternating-time temporal epistemic logic and its applications;concurrent semantics for the web services specification language DAML-s;exogenous and endogenous extensions of architectural types;coordinating mobile object-oriented code;formalizing properties of mobile agent systems;dynamically adapting the behaviour of software components;an associative broadcast based coordination model for distributed processes;state- and event-based reactive programming in shared dataspaces;integrating two organizational systems through communication genres;coordination in a reflective architecture description language;criteria for the analysis of coordination in multi-agent applications;towards a colimit-based semantics for visual programming;the cost of communication protocols and coordination languages in embedded systems;an elementary model for design and analysis of multi-agent systems;a recovery technique using multi-agent in distributed computing systems;an order-based, distributed algorithm for implementing multiparty interactions;exploiting transiently shared TUPLE spaces for location transparent code mobility;using logical operators as an extended coordination mechanism in Linda;a framework for coordinating parallel branch and bound algorithms;TUPLE-based models in the observation framework and semantics of protocol modules composition and interaction.
the adoption of object-oriented programming (OOP) paradigm to design and implement the test pattern generator became popular a few years ago because it provides a feature of data abstraction. Many test pattern generat...
详细信息
In tracking a single target in clutter, many algorithms have been developed ranging in complexity from nearest neighbor (NN) and probabilistic data association (PDA) to the optimal Bayesian filter. In multiple-target ...
详细信息
ISBN:
(纸本)0972184422
In tracking a single target in clutter, many algorithms have been developed ranging in complexity from nearest neighbor (NN) and probabilistic data association (PDA) to the optimal Bayesian filter. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used widely since the optimal algorithms have an exponentially increasing computational complexity since all the possible sequences of target-to-measurement associations must be considered. In this paper, the Viterbi algorithm (VA) is used to develop a parallel search data association algorithm, called the Viterbi Data Association (VDA) technique. this algorithm includes the gating, automatic track initiation and termination modules. Simulations have been carried out to verify the performance and the robustness of the proposed algorithm. Moreover, the VDA algorithm is compared withthe fuzzy data association (FDA) algorithm when tracking a target in a cluttered, low signal-to-noise ratio (SNR) environment.
暂无评论