检索结果-内蒙古大学图书馆

Extending disjunctive logic programming by T-norms 5th

5th International conference on logic programming and Nonmonotonic Reasoning (LPNMR 99)

作者： Mateis, C Vienna Univ Technol Dept Informat Syst A-1040 Vienna Austria

ISBN: (纸本)3540667490

this paper proposes a new knowledge representation language, called QDLP, which extends DLP to deal with uncertain values. A certainty degree interval (a subinterval of [0, 1]) is assigned to each (quantitative) rule. Triangular norms (T-norms) are employed to define calculi for propagating uncertainty information from the premises to the conclusion of a quantitative rule. Negation is considered and the concept of stable model is extended to QDLP. Different T-norms induce different semantics for one given quantitative program. In this sense, QDLP is parameterized and each choice of a T-norm induces a different QDLP language. Each T-norm is eligible for events with determinate relationships (e.g., independence, exclusiveness) between them. Since there are infinitely many T-norms, it turns out that there is a family of infinitely many QDLP languages. this family is carefully studied and the set of QDLP languages which generalize traditional DLP is precisely singled out. Finally the complexity of the main decisional problems arising in the context of QDLP (i.e., Model Checking, Stable Model Checking, Consistency, and Brave Reasoning) is analyzed. It is shown that the complexity of the relevant fragments of QDLP coincides exactly with the complexity of DLP. that is, reasoning with uncertain values is more general and not harder than reasoning with boolean values.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

5th Asian Computing Science conference, ASIAN 1999

5th Asian Computing Science Conference, ASIAN 1999

引用

5th Asian Computing Science conference on Advances in Computing Science, ASIAN 1999

ISBN: (纸本)354066856X

the proceedings contain 41 papers. the special focus in this conference is on Advances in Computing Science. the topics include: Emerging application domains and the computing fabric;the game of the name in cryptographic tables;a parallel approximation algorithm for the max cut problem on cubic graphs;rapid prototyping techniques for fuzzy controllers;transactional cache management with aperiodic invalidation scheme in mobile environments;observable sharing for functional circuit description;relating may and must testing semantics for discrete timed process algebras;a framework for formal reasoning about open distributed systems;structural sharing and efficient proof-search in propositional intuitionistic logic;verifying probabilistic programs using a hoare like logic;an expressive extension of TLC;completeness and decidability of a fragment of duration calculus with iteration;logical relations in circuit verification;lemma generalization and non-unit lemma matching for model elimination;on automating inductive and non-inductive termination methods;asynchronous links in the PBC and M-Nets;demand-driven model checking for context-free processes;programming the mobility behaviour of agents by composing itineraries;faster model checking for open systems;an argumentation approach to semantics of declarative programs with defeasible inheritance;entailment of non-structural subtype constraints;a CPS-transform of constructive classical logic;formal verification of the MCS list-based queuing lock;BDD-nodes can be more expressive;formal verification of descriptions with distinct order of memory operations;beyond tamaki-sato style unfold/fold transformations for normal logic programs and separators are as simple as cutsets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

5th International conference on Parallel Computing Technologies, PaCT 1999

5th International Conference on Parallel Computing Technolog...

引用

5th International conference on Parallel Computing Technologies, PaCT 1999

ISBN: (纸本)3540663630

the proceedings contain 59 papers. the special focus in this conference is on Parallel Computing in Regular Structures. the topics include: Analytical modeling of parallel application in heterogeneous computing environments;skeletons and transformations in an integrated parallel programming environment;sequential unification and aggressive lookahead mechanisms for data memory accesses;a coordination model and facilities for efficient parallel computation;parallelizing of sequential programs on the basis of pipeline and speculative features of the operators;kinetic model of parallel data processing;PSA approach to population models for parallel genetic algorithms;highly accurate numerical methods for incompressible 3D fluid flows on parallel architectures;dynamic task scheduling with precedence constraints and communication delays;two-dimensional scheduling of algorithms with uniform dependencies;consistent lamport clocks for asynchronous groups with process crashes;comparative analysis of learning methods of cellular-neural associative memory;emergence and propagation of round autowave in cellular neural network;routing and embeddings in super cayley graphs;implementing cellular automata based models on parallel architectures;overview, design innovations, and preliminary results;implementing model checking and equivalence checking for time petri nets by the RT-MEC tool;learning concurrent programming;the speedup performance of an associative memory based logic simulator;a high-level programming environment for distributed memory architectures;virtual shared files;an object oriented environment to manage the parallelism of the FIIT applications;performance studies of shared-nothing parallel transaction processing systems;synergetic tool environments and logically instantaneous communication on top of distributed memory parallel machines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An overview of HAL 5th

引用

5th International conference on Principles and Practice of Constraint programming, CP 1999

作者： Demoen, Bart de la Banda, Maria García Harvey, Warwick Marriott, Kim Stuckey, Peter Dept. of Computer Science K.U. Leuven Belgium School of Computer Science and Software Engineering Monash University Australia Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)3540666265

Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers. Equally importantly, HAL supports semi-optional type, mode and determinism declarations. these allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

European conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 1999

European Conference on Symbolic and Quantitative Approaches ...

引用

5th European conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 1999

ISBN: (纸本)354066131X

the proceedings contain 36 papers. the special focus in this conference is on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. the topics include: On the dynamics of default reasoning;non-monotonic and paraconsistent reasoning;a comparison of systematic and local search algorithms for regular CNF formulas;query-answering in prioritized default logic;updating directed belief networks;inferring causal explanations;a critique of inductive causation;connecting lexicographic with maximum entropy entailment;avoiding non-ground variables;anchoring symbols to vision data by fuzzy logic;filtering vs revision and update;irrelevance and independence axioms in quasi-bayesian theory;assessing the value of a candidate;learning default theories;knowledge representation for inductive learning;handling inconsistency efficiently in the incremental construction of stratified belief bases;rough knowledge discovery and applications;gradient descent training of bayesian networks;open default theories over closed domains;shopbot economics;optimized algorithm for learning bayesian network from data;merging with integrity constraints;boolean-like interpretation of sugeno integral;an alternative to outward propagation for dempster-shafer belief functions;on bottom-up pre-processing techniques for automated default reasoning;probabilisitc logic programming under maximum entropy;lazy propagation and independence of causal influence;a monte carlo algorithm for combining dempster-shafer belief based on approximate pre-computation;an extension of a linguistic negation model allowing us to deny nuanced property combinations;argumentation and qualitative decision making and handling different forms of uncertainty in regression analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Revision programming

引用

thEORETICAL COMPUTER SCIENCE 1998年第2期190卷 241-277页

作者： Marek, VW Truszczynski, M Univ Kentucky Dept Comp Sci Lexington KY 40546 USA

In this paper we introduce revision programming - a logic-based framework for describing constraints on databases and providing a computational mechanism to enforce them. Revision programming captures those constraints that can be stated in terms of the membership (presence or absence) of items (records) in a database. Each such constraint is represented by a revision rule alpha <-- alpha(1),...,alpha(k), where alpha and all alpha(i) are of the form in(a) and out(b). Collections of revision rules form revision programs. Similarly as logic programs, revision programs admit both declarative and imperative (procedural) interpretations. In our paper, we introduce a semantics that reflects both interpretations. Given a revision program, this semantics assigns to any database B a collection (possibly empty) of P-justified revisions of B. the paper contains a thorough study of revision programming. We exhibit several fundamental properties of revision programming. We study the relationship of revision programming to logic programming. We investigate complexity of reasoning with revision programs as well as algorithms to compute P-justified revisions. Most importantly from the practical database perspective, we identify two classes of revision programs, safe and stratified, with a desirable property that they determine for each initial database a unique revision.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards agent-oriented smart office based on concurrent logic languages 5th

Towards agent-oriented smart office based on concurrent logi...

引用

5th Pacific Rim International conference on Artificial Intelligence (PRICAI 98)

作者： Nishiyama, H Ohwada, H Mizoguchi, F Tokyo Univ Sci Fac Sci & Tech Noda Chiba 2788510 Japan

ISBN: (纸本)354065271X

this paper presents an AI architecture for multiple robots working collaboratively in a future smart office. this architecture integrates the control, communication, planning, and learning necessary to agentify office robots. Such integration is based on our multiagent robot language (MRL), which is an extension of concurrent logic programming languages (CCL). While the behavior of an agent is specified within guarded Horn clause logic, the communication and concurrency controls are amenable to the operational semantics of CCL. Our planning module provides well-balanced coordination between single agent planning and supervisor-level planning, yielding the minimum interaction for multiagent communication and control. Furthermore, inductive learning is incorporated into the planning module and is applied to produce empirical rules for action selection, providing the utility of multiagent problem solving. these features allow a unified view of both low- and high-level computation, which enables intelligent collaboration between robotic agents and provides a powerful framework for distributed AI and agent-oriented programming in the real world.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Developmental logic: establishing a relationship between developmental process and phylogenetic pattern in primitive vascular plants

引用

REVIEW OF PALAEOBOTANY AND PALYNOLOGY 1998年第1-2期102卷 15-42页

作者： Stein, WE SUNY Binghamton Dept Biol Sci Binghamton NY 13902 USA

Cladistic methods serve as a powerful example of the current shift in epistemology from a largely inductivist stance toward more 'hypothetico-deductive' or 'strong inference' approaches. However, in the area of character analysis, especially in addressing the roles of developmental and evolutionary processes influencing our understanding of homology, synapomorphy, and evolutionary pattern, it appears that little has changed. this omission has the very real potential of substantially limiting resolution and reliability of cladistic hypotheses, and points to the need for an expanded methodology that simultaneously addresses evolutionary pattern and underlying causal factors. Due to unique aspects of both plant development and evolutionary history, early vascular plants offer attractive features that make them highly suitable as a test case along these lines. Expanding on the Zimmermann's 'telome theory' of a strong inference approach to developmental process is suggested by employing an analogy with logic gates and logic circuits in programming theory. Hypothesized units of developmental dynamic, termed 'evolutionary developmental gates' (EDG) define a relationship between external and internal 'environmental' factors, and developmental outcome, using a logical conditional. EDGs are then assembled into networks, specifying a relationship between developmental processes and resultant morphological structure, that may be tested. Testing utilizes several lines of evidence including comparing EDGs with specific developmental data, computer modelling, and evolutionary comparisons based on fossil and living taxa. To illustrate this approach, and to initiate analysis of what constitutes a set of developmental processes necessary for describing primitive vascular plant form, four developmental modules comprised of networks of EDGs are proposed. these include: (1) establishment of self-recognition at the shoot apex along with initiation of a hormone (auxin) gradient, (2) norma

关键词： development homology plants phylogeny logic

来源：评论

学校读者我要写书评

暂无评论

Implementing global constraints with index-sets and constraint templates 4th

引用

4th International conference on Principles and Practice of Constraint programming (CP 98)

作者： Colombani, Y Dash Associates Leamington Spa CV32 5TH England

ISBN: (纸本)3540652248

In order to improve the deductive power of ffinite domain constraint solvers usually redundant and global constraints are added to the constraint system. the objective of this work [2] is to develop a new constraint solving scheme designed as an extension of a classical arc-consistency algorithm. Associated to a declarative language, it allows the user to implement his own global relations without the need of manipulating internal structures of the solver or modifying in depth the original model of the studied problem. this system relies on two new structures: index-sets and constraint templates. the former consist in sets of integers used as indices over tables. they collect variables sharing some properties (for instance tasks in a scheduling problem assigned to the same machine). the latter are descriptions of constraints that must be applied (possibly) over selected sets of variables (for instance the fact that a set of tasks must be scheduled before another set). Both, set-index and constraint template deffnitions are evaluated dynamically and depend on the variables’ domains. Indeed, the new constraints are automatically generated by the constraint solver based on the set contents and variable domain values. the index-set and constraint deffinition language uses a mathematic style notation. the deffnitions are compiled to the solver representation which can be directly handled by the propagation mechanism. this organisation guarantees a high level of efficiency.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Simple + parallel + local = cellular computing

Simple + parallel + local = cellular computing

引用

5th International conference on Parallel Problem Solving from Nature, PPSN 1998

作者： Sipper, Moshe Logic Systems Laboratory Swiss Federal Institute of Technology CH-1015 Lausanne Switzerland

ISBN: (纸本)3540650784

In recent years we are witness to a growing number of researchers who are interested in novel computational systems based on principles that are entirely different than those of classical computers. though coming from disparate domains, their work shares a common computational philosophy, which I call cellular computing. Basically, cellular computing is a vastly parallel, highly local computational paradigm, with simple cells as the basic units of computation. It aims at providing new means for doing computation in a more efficient manner than other approaches (in terms of speed, cost, power dissipation, information storage, quality of solutions), while potentially addressing much larger problem instances than was possible before-at least for some application domains. this paper provides a qualitative exposition of the cellular computing paradigm, including sample applications and a discussion of some of the research issues involved.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：