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

7th Conference on Advances in Modal logic, AiML-2008

作者： Hansen, Jens Bolander, Thomas Braüner, Torben Programming Logic and Intelligent Systems Research Group Science Studies Research Group Roskilde University P.O. Box 260 DK-4000 Roskilde Denmark Informatics and Mathematical Modelling Building 322 Technical University of Denmark Richard Petersens Plads DK-2800 Lyngby Denmark

ISBN: (纸本)1904987206

In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is proof-theoretically well-behaved, in particular, it gives rise to a decision procedure for the logic. This shows that many-valued hybrid logics is a natural enterprise and opens up the way for future applications. © 2008, the author(s).

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

A Farewell to Harms: Risk Management for Medical Devices via the Riskman Ontology & Shapes

arXiv

引用

arXiv 2024年

作者： Gorczyca, Piotr Arndt, Dörthe Diller, Martin Kettmann, Pascal Mennicke, Stephan Strass, Hannes Computational Logic Group Institute of Artificial Intelligence Germany Logic Programming and Argumentation Group Institute of Artificial Intelligence Germany Knowledge-Based Systems Group Institute for Theoretical Computer Science Germany Faculty of Computer Science TU Dresden Germany

We introduce the Riskman ontology & shapes for representing and analysing information about risk management for medical devices. Risk management is concerned with taking necessary precautions so a medical device does not cause harms for users or the environment. To date, risk management documentation is submitted to notified bodies (for certification) in the form of semi-structured natural language text. We propose to use classes from the Riskman ontology to logically model risk management documentation, and to use the included SHACL constraints to check for syntactic completeness and conformity to relevant standards. In particular, the ontology is modelled after ISO 14971 and the recently published VDE Spec 90025. Our proposed methodology has the potential to save many person-hours for both manufacturers (when creating risk management documentation) as well as notified bodies (when assessing submitted applications for certification), and thus offers considerable benefits for healthcare and, by extension, society as a whole. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

On implicit meanings

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年第PART2期2408卷 506-525页

作者： Dahl, Veronica Logic and Functional Programming Group School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9781627032292

We present a logic programming parsing methodology which we believe especially interesting for understanding implicit human-language structures. It records parsing state constituents through linear assumptions to be consumed as the corresponding constituents materialize throughout the computation. Parsing state symbols corresponding to implicit structures remain as undischarged assumptions, rather than blocking the computation as they would if they were subgoals in a query. They can then be used to glean the meaning of elided structures, with the aid of parallel structures. Word ordering inferences are made not from symbol contiguity as in DCGs, but from invisibly handling numbered edges as parameters of each symbol. We illustrate our ideas through a metagrammatical treatment of coordination, which shows that the proposed methodology can be used to detect and resolve parallel structures through syntactic and semantic criteria. © Springer-Verlag Berlin Heidelberg 2002.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

AN ASSUMPTIVE logic programming METHODOLOGY FOR PARSING

引用

International Journal on Artificial Intelligence Tools 2001年第4期10卷 573-588页

作者： KIMBERLY D. VOLL TOM P. YEH VERONICA DAHL Logic and Functional Programming Group School of Computing Science Simon Fraser University Burnaby B.C. Canada V5A 1S6 Canada

We show how two novel tools in logic programming for AI (namely, continuation-based linear and timeless assumptions, and Datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for Datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words) that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.

关键词： Datalog grammars Hypothetical reasoning Left-corner parsing Linear affine implication Coordination Error detection and correction

来源：评论

学校读者我要写书评

暂无评论

logic programming and logic grammars with first-order continuations 4th

引用

4th International Workshop on logic Program Synthesis and Transformation, LOPSTR 1994 and Metaprogramming in logic, META 1994

作者： Tarau, Paul Dahl, Veronica Département d’Informatique Université de Moncton MonctonNBE1A 3E9 Canada Logic Programming Group Department of Computing Sciences Simon Fraser University BurnabyBCV5A 1S6 Canada

ISBN: (纸本)9783540587927

Continuation passing binarization and specialization of the WAM to binary logic programs have been proven practical implementation techniques in the BinProlog system. In this paper we investigate the additional benefits of having first order continuations at source level. We devise a convenient way to manipulate them by introducing multiple-headed clauses which give direct access to continuations at source-level. We discuss the connections with various logic grammars, give examples of typical problem solving tasks and show how looking at the future of computation can improve expressiveness and describe complex control mechanisms without leaving the framework of binary definite programs. © Springer-Verlag Berlin Heidelberg 1994.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

UNIFORM ALGEBRAIC SPECIFICATIONS OF FINITE SETS WITH EQUALITY

引用

International Journal of Foundations of Computer Science 1991年第1期2卷 43-65页

作者： J.A. BERGSTRA S. MAUW F. WIEDIJK Programming Research Group University of Amsterdam Kruislaan 403 1098 SJ Amsterdam The Netherlands Applied Logic Group University at Utrecht Utrecht The Netherlands Sponsored in part by ESPRIT project 432 (METEOR). Sponsored by an NWO research grant.

We study a variety of ways to specify a two sorted structure involving the Booleans B, with constants true and false and a finite set D with an equality function eq to the Booleans, under the assumption that there is a constant (name) for each element of D. The specifications are evaluated with respect to several properties, like textual length, efficiency in execution and the use of special features.

关键词： formal description techniques abstract data types algebraic specifications

来源：评论

学校读者我要写书评

暂无评论

Using definite clauses and integrity constraints as the basis for a theory formation approach to diagnostic reasoning 3rd

引用

3rd International Conference on logic programming, ICLP 1986

作者： Goebel, Randy Furukawa, Koichi Poole, David Logic Programming and AI Group Department of Computer Science University of Waterloo WaterlooN2L 3GI Canada First Research Laboratory Inst. for New Generation Computer Technology 21F Mita Kokusai Bldg Minato-ku Tokyo108 Japan

ISBN: (纸本)9783540164920

If one desires that an automatic theory formation program detect inconsistency in a set of hypotheses, the Horn clause logic of Prolog is unsuitable as no contradiction is derivable. Full first order logic provides a suitably expressive alternative, but then requires a full first order theorem-prover as the basic theory construction mechanism. Here we present an alternative for augmenting definite clauses with the power to express potentially inconsistent scientific theories. The alternative is based on a partitioning of definite clauses into two categories: ordinary assertions, and integrity constraints. This classification provides the basis for a simple theory formation program. We here describe such a theory formation system based on Prolog, and show how it provides an interesting reformulation of rule-based diagnosis systems like MYCIN. © 1986, Springer-Verlag.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Constraint Solving and Language Processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Henning Christiansen Peter Rossen Skadhauge Jørgen Villadsen

ISBN: (数字)9783540319283

ISBN: (纸本)9783540261650

This volume contains selected and thoroughly revised papers plus contributions from invited speakers presented at the First International Workshop on C- straint Solving and Language Processing, held in Roskilde, Denmark, September 1–3, 2004. Constraint programming and Constraint Solving, in particular Constraint logic programming, appear to be a very promising platform, perhaps the most promising present platform, for bringing forward the state of the art in natural language processing, this due to the naturalness in speci?cation and the direct relation to e?cient implementation. Language, in the present context, may - fer to written and spoken language, formal and semiformal language, and even general input data to multimodal and pervasive systems, which can be handled in very much the same ways using constraint programming. The notion of constraints, with slightly di?ering meanings, apply in the ch- acterization of linguistic and cognitive phenomena, in formalized linguistic m- els as well as in implementation-oriented frameworks. programming techniques for constraint solving have been, and still are, in a period with rapid devel- ment of new e?cient methods and paradigms from which language processing can pro?t. A common metaphor for human language processing is one big c- straintsolvingprocessinwhichthedi?erent(-lyspeci?ed)linguisticandcognitive phases take place in parallel and with mutual cooperation, which ?ts quite well with current constraint programming paradigms.

关键词： Artificial Intelligence programming Techniques programming Languages, Compilers, Interpreters Mathematical logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

A hypothetical reasoning based framework for NL processing

A hypothetical reasoning based framework for NL processing

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： V. Dahl A. Fall S. Rochefort P. Tarau Logic Programming Group School of Computing Science Simon Fraser University Burnaby BC Canada Département d'Informatique Université de Moncton Moncton Canada

We examine some natural language uses of a new type of logic grammars called Assumption Grammars, particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over the current continuation, which allow us to follow given branches of the computation under hypotheses that disappear when and if backtracking takes place. We show how Assumption Grammars can simplify the treatment of some crucial computational linguistics problems, e.g. long distance dependencies, while simultaneously facilitating more readable grammars.

关键词： logic programming Mars Natural languages Helium Delay Concrete Natural language processing Switches

来源：评论

学校读者我要写书评

暂无评论

Machine intelligibility and the duality principle

British Telecom technology journal

引用

British Telecom technology journal 1996年第4期14卷 15-23页

作者： Muggleton, S. Michie, D. Wolfson College Oxford United Kingdom University of Tokyo Turing Institute Glasgow United Kingdom Intelligent Systems Research Group BT Laboratories Inductive Logic Programming Oxford University Press Logic Programming ILP Oxford Univ. Computing Laboratory University of Edinburgh Royal Society of Edinburgh British Computer Society

Lack of machine intelligibility in human/computer interactions can be traced to present approaches in software design. From the duality principle, software involved in human/computer software interaction contains two distinct layers, a declarative knowledge-level layer and a lower-level functional or procedural-knowledge layer. The former supports simple deductive and inductive inferences and can be used to facilitate human-comprehensible communication between programs, while the latter is composed of normal procedurally encoded computer programs. The duality principle in software design is necessary in dealing with the demands of wide-scale computer usage in the information age and an urgent goal for computer science research.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：