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

7th international Workshop on Modular Ontologies, WoMO 2013 - Co-located with the 12th international conference on logic programming and non-monotonic reasoning, LPNMR 2013

作者： Schäfermeier, Ralph Paschke, Adrian Freie Universität Berlin Königin-Luise-Str. 24-26 Berlin14195 Germany

In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

17th international Symposium on Functional and logic programming, FLOPS 2024

17th International Symposium on Functional and Logic Program...

引用

17th international Symposium on Functional and logic programming, FLOPS 2024

ISBN: (纸本)9789819722990

the proceedings contain 16 papers. the special focus in this conference is on Functional and logic programming. the topics include: Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement;a Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting;tabulation with Zippers;declarative Pearl: Rigged Contracts;System Description: DeepLLM, Casting Dialog threads into logic Programs;a Constraint-Based Mathematical Modeling Library in Prolog with Answer Constraint Semantics;grants4Companies: Applying Declarative Methods for Recommending and reasoning About Business Grants in the Austrian Public Administration (System Description);inferring non-failure Conditions for Declarative Programs;being Lazy When It Counts Practical Constant-Time Memory Management for Functional programming;MetaOCaml: Ten Years Later System Description;An ML-Style Module System for Cross-Stage Type Abstraction in Multi-stage programming;rhyme: A Data-Centric Multi-paradigm Query Language Based on Functional logic Metaprogramming System Description;language-parameterized Proofs for Functional Languages with Subtyping;system Description: A theorem-Prover for Subregular Systems: the Language Toolkit and Its Interpreter, Plebby.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Synthesis of Reactive Agents

Automatic Synthesis of Reactive Agents

引用

11th international conference on Control, Automation, Robotics and Vision (ICARCV 2010)

作者： Song, Insu Governatori, Guido Diederich, Joachim James Cook Univ Australia Sch Business & IT Singapore Singapore NICTA Natl ICT Australia Educ Queensland Res Lab Sydney NSW Australia

ISBN: (纸本)9781424478132

this paper introduces a new approach to designing smart control chips that enables automatic synthesis of real-time control systems from agent specifications. An agent specification is compiled into a hardware description format, such as RTL-VHDL (Register Transfer Level-VLSI Hardware Description Language) or RTL Verilog, which is synthesized using computer-assisted tools to develop ASIC masks or FPGA configurations. A rule-based specification language called Layered Argumentation System ( LAS) is defined and a sound and complete mapping to Verilog is developed. LAS combines fuzzy reasoning and non-monotonic reasoning. this enables chip designers to capture commonsense knowledge and concepts having varying degrees of confidence collaboratively and incrementally.

关键词： control systems reactive systems circuit synthesis agent programming fuzzy controller logic controller

来源：评论

学校读者我要写书评

暂无评论

A computational logic approach to heterogenous agent systems

引用

6th international conference on logic programming and nonmonotonic reasoning, LPNMR 2001

作者： Dix, Jürgen University of Manchester Dept. of CS Oxford Road Manchester M13 9PL United Kingdom

ISBN: (纸本)3540425934

I report about a particular approach to heterogenous agent systems, IMPACT, which is strongly related to computational logic. the underlying methods and techniques stem from both non-monotonic reasoning and logic programming. I present three recent extensions to illustrate the generality and usefulness of the approach: (1) incorporating planning, (2) uncertain (probabilistic) reasoning, and (3) reducing the load of serving multiple requests. While (1) illustrates how easy it is to incorporate hierachical task networks into IMPACT, (2) makes heavily use of annotated logic programming and (3) is strongly related to classical first-order reasoning. this paper is a high-level description of (1)-(3), More detailed expositions can be found in [1, 2, 3, 4] from which most parts of this paper are taken. © Springer-Verlag Berlin Heidelberg 2001.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Symbolic Analysis of Maude theories with Narval

引用

thEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 874-890页

作者： Alpuente, Maria Escobar, Santiago Sapina, Julia Ballis, Demis Univ Politecn Valencia VRAIN Valencian Res Inst Artificial Intelligence Valencia Spain Univ Udine DMIF Udine Italy

Concurrent functional languages that are endowed with symbolic reasoning capabilities such as Maude offer a high-level, elegant, and efficient approach to programming and analyzing complex, highly nondeterministic software systems. Maude's symbolic capabilities are based on equational unification and narrowing in rewrite theories, and provide Maude with advanced logic programming capabilities such as unification modulo user-definable equational theories and symbolic reachability analysis in rewrite theories. Intricate computing problems may be effectively and naturally solved in Maude thanks to the synergy of these recently developed symbolic capabilities and classical Maude features, such as: (i) rich type structures with sorts (types), subsorts, and overloading;(ii) equational rewriting modulo various combinations of axioms such as associativity, commutativity, and identity;and (iii) classical reachability analysis in rewrite theories. However, the combination of all of these features may hinder the understanding of Maude symbolic computations for non-experienced developers. the purpose of this article is to describe how programming and analysis of Maude rewrite theories can be made easier by providing a sophisticated graphical tool called Narval that supports the fine-grained inspection of Maude symbolic computations.

关键词： Symbolic reachability analysis narrowing equational unification Maude rewriting logic

来源：评论

学校读者我要写书评

暂无评论

eclingo : A Solver for Epistemic logic Programs

引用

thEORY AND PRACTICE OF logic programming 2020年第6期20卷 834-847页

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. the eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. this process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.

关键词： Answer Set programming Epistemic logic Programs non-monotonic reasoning Conformant Planning

来源：评论

学校读者我要写书评

暂无评论

Modular-ε:: An elaboration tolerant approach to the ramification and qualification problems

<i>M</i>odular-ε:: An elaboration tolerant approach to the ...

引用

8th international conference on logic programming and nonmonotonic reasoning

作者： Kakas, A Michael, L Miller, R Univ Cyprus CY-1678 Nicosia Cyprus Harvard Univ Cambridge MA 02138 USA UCL London WC1E 6BT England

ISBN: (纸本)3540285385

We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects (ramifications). We give formal results which characterize ME's high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide a principled solutions to, the endogenous and exogenous qualification problems. We also show how a notion of (micro) processes can be used to facilitate reasoning at the dual levels of temporal granularity necessary for narrative-based domains involving "instantaneous" series of indirect and knock-on effects.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Extended Computation Tree logic

Extended Computation Tree Logic

引用

17th international conference on logic for programming, Artificial Intelligence, and reasoning

作者： Axelsson, Roland Hague, Matthew Kreutzer, Stephan Lange, Martin Latte, Markus Univ Munich Dept Comp Sci D-80539 Munich Germany

ISBN: (纸本)9783642162411

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled. We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation, etc. We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. this makes the logic a promising candidate for applications in verification. In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Automating Defeasible reasoning in Law with Answer Set programming 38

Automating Defeasible Reasoning in Law with Answer Set Progr...

引用

38th international conference on logic programming Workshops, ICLP Workshops 2022

作者： Khang, Lim How Mahajan, Avishkar Strecker, Martin Wong, Meng Weng Singapore Management University Singapore

the paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that eliminate these modifiers, leading in the end to a translation of rules to formulas. For reasoning with and about rules, we contrast two approaches, one in a classical logic with SMT solvers, which is only briefly sketched, and one using non-monotonic logic with Answer Set programming solvers, described in more detail. © 2022 Copyright for this paper by its authors.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Possible and Necessary Answer Sets of Possibilistic Answer Set Programs

Possible and Necessary Answer Sets of Possibilistic Answer S...

引用

IEEE 24th international conference on Tools with Artificial Intelligence (ICTAI)

作者： Bauters, Kim Schockaert, Steven De Cock, Martine Vermeir, Dirk Univ Ghent Dept Appl Math & Comp Sci B-9000 Ghent Belgium Cardiff Univ Sch Comp Sci & Informat Cardiff CF24 3AA S Glam Wales Vrije Univ Brussels Dept Comp Sci B-1050 Brussels Belgium

ISBN: (纸本)9780769549156;9781479902279

Answer set programming (ASP) and possibility theory can be combined to form possibilistic answer set programming (PASP), a framework for non-monotonic reasoning under uncertainty. Existing proposals view answer sets of PASP programs as weighted epistemic states, in which the strength by which different literals are believed to hold may vary. In contrast, in this paper we propose an approach in which epistemic states remain Boolean, but some epistemic states may be considered more plausible than others. A PASP program is then a representation of an incomplete description of these epistemic states where certainties are associated with each rule which is interpreted in terms of a necessity measure. the main contribution of this paper is the introduction of a new semantics for PASP as well as a study of the resulting complexity.

关键词： Boolean functions computational complexity logic programming nonmonotonic reasoning possibility theory uncertainty handling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：