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

Conceptual graphs as algebras-with an application to analogical reasoning 7th

7th international conference on Conceptual Structures, ICCS 1999

作者： Braüner, Torben Nilsson, Jørgen Fischer Rasmussen, Anne InterMedia Aalborg University Fredrik Bajers Vej 7 C Aalborg East9220 Denmark Department of Information Technology Technical University of Denmark Building 344 Lyngby2800 Denmark Department of Communication Aalborg University Langagervej 8 Aalborg East9220 Denmark

ISBN: (纸本)3540662235

the first part of this paper presents a logico-algebraic reconstruction of conceptual graph fundamentals using an appropriately extended binary relation algebra. the algebraisation comprises axioms which in a straightforward and instructive fashion admit deductive reasoning by term rewriting. As an application of the described logico-algebraic framework, the second part of the paper addresses formalisation of analogical reasoning. It is suggested that analogical reasoning be carried out as clausal resolution inference using axioms of the binary relation algebra together with the application specific axioms corresponding to the domains under consideration. this makes the analogical reasoning amenable to implementation in logic programming languages. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Extensions to the estimation calculus

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Gow, Jeremy Bundy, Alan Green, Ian Institute for Representation and Reasoning Division of Informatics University of Edinburgh 80 South Bridge Edinburgh EH1 1HN United Kingdom

ISBN: (纸本)3540664920

Walther's estimation Cetlculus was designed to prove the termination of functional programs, etnd can also be used to solve the similar problem of proving the well-foundedness of induction rules. However, there are certain features of the goal formulae which axe more common to the problem of induction rule well-foundedness than the problem of termination, eind which the calculus Ccinnot handle. We present a sound extension of the cailculus that is capable of dealing with these features. the extension develops Walther's concept of an argument bounded function in two ways: firstly, so that the function may be bounded below by its cirgument, and secondly, so that a bound may exist between two aiguments of a predicate. Our calculus enables automatic proofs of the well-foundedness of a large class of induction rules not captiued by the original calculus.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Beth definability for the guarded fragment

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Hoogland, Eva Marx, Maarten Otto, Martin Dept. of WINS Universiteit Van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam Netherlands Dept. of Artificial Intelligence Faculty of Sciences Vrije Universiteit Amsterdam De Boelelaan 1081a 1081 HV Amsterdam Netherlands Mathematical Foundations of Computer Science RWTH Aachen Ahornstr.55 52074 Aachen Germany

ISBN: (纸本)3540664920

the guarded fragment (GF) was introduced in [ABN98] as a fragment of first order logic which combines a great expressive power with nice modal behavior. It consists of relationeil first order formulas whose qucintüiers are relativized by atoms in a certain way. While GF hsis been established as a particularly well-behaved fragment of first order logic in many respects, interpolation fails in restriction to GF, [HM99]. In this paper we consider the Beth property of first order logic and show that, despite the failure of interpolation, it is retained in restriction to GF. Being a closure property w.r.t. definability, the Beth property is of independent interest, both theoretically and for typical potential appUcations of GF, e.g., in the context of description logics. the Beth property for GF is here established on the basis of a limited form of interpolation, which more closely resembles the interpolation property that is usuEdly studied in modetl logics. From this we obtzün that, more specifically, even every n-variable guarded fragment with up to n-aiy relations has the Beth property.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

On the complexity of single-rule datalog queries

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Gottlob, Georg Papadimitriou, Christos Computer Science Division Dept of Electrical Engineering and Computer Science University of California Berkeley Berkeley CA 94720 United States

ISBN: (纸本)3540664920

Datalog is a well-known database query language based on the logic programming paradigm. A general datalog program consists of a number of rules and facts. Programs containing a unique rule and possibly some facts are called single rule programs (sirups). We study both the combined and the program complexity of sirups, ie., the complexity of evaluating sirups over variable and fixed databases, respectively. Moreover, we study the descriptive complexity of sirups, i.e., their expressive power. In ail cases it turns out that even very restricted classes of sirups have the same complexity and essentially the same expressive power as general datalog programs. We show that the evaluation of single clause programs is EXPTIME complete (combined complexity), and, if restricted to linear recursive rules, PSPACE complete. Moreover, sirups with one recursive rule and one additional fact capture PTIME on ordered structures, if a certain data representation is assumed and certain predefined relations are provided. Our results are obtained by a uniform product construction which maps a datalog program into a single rule by essentially maintaining its semantics. We also prove that the datalog clause implication problem, i.e., deciding whether a datalog clause implies another one, is EXPTIME complete.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

CHAT is θ(SLG-WAM)

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Demoen, Bart Sagonas, Konstantinos Department of Computer Science Katholieke Universiteit Leuven Belgium Computing Science Department Uppsala Universitet Sweden

ISBN: (纸本)3540664920

CHAT offers an Eilternative to SLG-WAM for implementing the suspension eind resumption of consumers that tabling needs;unlike SLG-WAM, it does not use freeze registers nor a complicated trail to preserve their execution environments. CHAT Eilso limits the amount of copying of CAT, which was previously put forwMd as another alternative to SLG-WAM. Although experimented results show that in preictice CHAT is competitive with - if not better than - SLG-WAM, there remains the annoying fact that on contrived programs the original CHAT can be made axbitraxily worse than SLG-WAM, i.e. the origincd CHAT has an intrinsically higher complexity. In this paper we show how to overcome this problem, in particular, we deal with the two sources of higher complexity of CHAT: the repeated traversal of the choice point stack, Eind the lack of sufficient sharing of the trail. this is eichieved without fundamentally changing the underlying principle of CHAT by a technique that manipulates a Prolog choice point so that it assumes temporarily a different functionality smd in a way that is treinsparent to the underlying WAM. there is more potential use of this technique besides lowering the worst case complexity of CHAT: it leads to considering scheduling strategies that were not feasible before either in CHAT or in SLG-WAM. We aJso discuss extensively issues related to the implementation of the trail in a tabled logic programming system.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

First order linear temporal logic over finite time structures

引用

6th international conference on logic for programming and Automated reasoning, LPAR 1999

作者： Cerrito, Serenella Mayer, Marta Cialdea Praud, Sébastien Université de Paris-Sud L.R.I. France Università di Roma Tre France

ISBN: (纸本)3540664920

In this work, the notion of provability for first order linear temporal logic over finite time structures, FO-LTLfin, is studied. We show that the validity problem for such a logic is not recursively enumerable, hence FO-LTLfin is not recursively axiomatizable. this negative result however does not hold in the case of bounded validity, that is truth in all temporal models where the object domain is possibly infinite, but the underlying sequence of time points does not exceed a given size. A formula is defined to be A-valid if it is true in all tempered models whose underlying time frtime is not greater them κ, where κ is any fixed positive integer. In this work a tableau calculus is defined, that is sound and complete with respect to κ-validity, when given as input the initial formula and the bound κ on the size of the temporal models. the main feature of the system, extending the prepositional calculus defined in [7], is that of explicitly denoting time points and having tableau nodes labelled by either expressions intuitively stating that a formula holds in a given temporal interval or "temporal constraints" i.e. linear inequalities on time points. Branch closure is reduced to unsatisfiability over the integers of the set of temporal constraints in the branch.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

7th international Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999

7th International Workshop on New Directions in Rough Sets, ...

引用

7th international Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999

ISBN: (纸本)3540666451

the proceedings contain 68 papers. the special focus in this conference is on Rough Computing, Rough Set theory and Its Applications. the topics include: Decision rules, bayes’ rule and rough sets;from computation with measurements to computation with perceptions;on text mining techniques for personalization;a road to discovery science;approximate distributed synthesis and granular semantics for computing with words;discovery of rules about complications;rough genetic algorithms;a rough-fuzzy neural computational approach;toward spatial reasoning in the framework of rough mereology;an algorithm for finding equivalence relations from tables with non-deterministic information;on the extension of rough sets under incomplete information;an alternative formulation;formal rough concept analysis;noise reduction in telecommunication channels using rough sets and neural networks;rough set analysis of electrostimilation test database for the prediction of post-operative profits in cochlear implanted patients;a rough set-based approach to text classification;modular rough fuzzy MLP;correspondence and complexity results;handling missing values in rough set analysis of multi-attribute and multi-criteria decision problems;the generic rough set inductive logic programming model and motifs in strings;rough problem settings for inductive logic programming;using rough sets with heuristics to feature selection;the discretization of continuous attributes based on compatibility rough set and genetic algorithm;level cut conditioning approach to the necessity measure specification;four c-regression methods and classification functions and context-free fuzzy sets in data mining context.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A formal basis for consistency, evolution and rationale management in requirements engineering

A formal basis for consistency, evolution and rationale mana...

引用

international conference on Tools for artificial intelligence (ICTAI)

作者： A.K. Ghose Decision Systems Laboratory/Department of Business Systems University of Wollongong NSW Australia

this paper presents a formal framework that addresses the twin problems of inconsistencies in requirements specifications and requirements evolution. It presents techniques (building on results from the areas of default reasoning and belief revision) for identifying maximal consistent subsets of a specification rendered inconsistent by a change step, with provision for retaining requirements that would be otherwise discarded, in anticipation of their future reuse. the paper identifies the need for consistent application of requirements rationale and provides support for this in the framework. While the problem of requirements evolution is intractable in the general case, tractable special cases exist within the framework. the paper also provides pointers to designing tools based on this framework.

关键词： Engineering management Costs Australia Design engineering programming Databases logic

来源：评论

学校读者我要写书评

暂无评论

Sixth European Workshop on logics in artificial intelligence (JELIA '98)

引用

AI Communications 1998年第3期11卷 237-240页

作者： Stol, Maarten Univ of Amsterdam Amsterdam Netherlands

the sixth European Workshop on logics in artificial intelligence (JELIA '98) was held in Schloss Dagstuhl, Germany from the 12th through the 15th of October 1998. the aim of the conference was to bring together researchers involved in all aspects of logic that play an important role in artificial intelligence and to lay particular emphasis on the application of running systems. Presented topics include: logic programming;theorem proving for forward reasoning strategies;Mho-resolution rule;natural language ambiguity;Herbrand models;propositional greatest lower bounds;non-standard logics;epistemic logic;syntactic higher order generalization;goal directed behavior;and nonmonotonic reasoning.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Reducing query answering to satisfiability in nonmonotonic logics

Reducing query answering to satisfiability in nonmonotonic l...

引用

15th National conference on artificial intelligence (AAAI 98) / 10th conference on Innovative Applications of artificial intelligence (IAAI 98)

作者： Rosati, R Univ Rome La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

ISBN: (纸本)0262510987

We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specifically, we study the relationship between satisfiability and logical implication in nonmonotonic logics, showing that, in many nonmonotonic formalisms, it is possible and easy to reduce logical implication to satisfiability. this result not only allows for establishing new complexity results for the satisfiability problem in nonmonotonic logics, but also establishes a clear relationship between the studies on epistemic queries and integrity constraints in monotonic knowledge bases with the work on negation by default in nonmonotonic reasoning and logic programming. From the perspective of the design of knowledge representation systems, such a reduction allows for defining both a simple method for answering epistemic queries in knowledge bases with nonmonotonic abilities, and a procedure for identifying integrity constraints in the knowledge base, which can be employed for optimizing reasoning in such systems.

关键词： computability Knowledge Bases Negation nonmonotonic reasoning Formal logic logic programming Knowledge Representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：