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

26th International Conference on logic programming (ICLP)

作者： Corapi, Domenico Russo, Alessandra Lupu, Emil Imperial Coll London Dept Comp 180 Queens Gate London SW7 2AZ England

ISBN: (纸本)9783939897170

We present a novel approach to non-monotonic ILP and its implementation called TAL (Top-directed abductive Learning). TAL overcomes some of the completeness problems of ILP systems based on Inverse Entailment and is the first top-down ILP system that allows background theories and hypotheses to be normal logic programs. The approach relies on mapping an ILP problem into an equivalent ALP one. This enables the use of established ALP proof procedures and the specification of richer language bias with integrity constraints. The mapping provides a principled search space for an ILP problem, over which an abductive search is used to compute inductive solutions.

关键词： Inductive logic programming abductive logic programming Non-monotonic Reasoning

来源：评论

学校读者我要写书评

暂无评论

A Computational logic Application Framework for Service Discovery and Contracting

引用

INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH 2011年第3期8卷 1-25页

作者： Alberti, Marco Cattafi, Massimiliano Chesani, Federico Gavanelli, Marco Lamma, Evelina Mello, Paola Montali, Marco Torroni, Paolo Univ Nova Lisboa Lisbon Portugal Univ Ferrara Dept Engn I-44100 Ferrara Italy Univ Ferrara Fac Engn I-44100 Ferrara Italy Univ Bologna DEIS Dept I-40126 Bologna Italy Free Univ Bozen Bolzano KRDB Res Ctr Bolzano Italy

In Semantic Web technologies, searching for a service means identifying components that can potentially satisfy user needs in terms of inputs and outputs (discovery) and devise a fruitful interaction with the customer (contracting). In this paper, the authors present an application framework that encompasses both the discovery and the contracting steps in a unified search process. In particular, the authors accommodate service discovery by ontology-based reasoning and contracting by reasoning about behavioural interfaces, published in a formal language. To this purpose, the authors consider a formal approach grounded on Computational logic. They define, illustrate, and evaluate a framework, called SCIFF Reasoning Engine (SRE), which can establish if a Semantic Web Service and a requester can fruitfully inter-operate, by computing a possible interaction plan based on the behavioural interfaces of both. The same operational machinery used for contracting can be used for runtime verification.

关键词： abductive logic programming Analysis Contracting Interoperability Proof Procedure Rules Semantic Discovery Web Services

来源：评论

学校读者我要写书评

暂无评论

Abduction guided query relaxation 11

Abduction guided query relaxation

引用

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3

作者： Samy Sá João Alcântara Universidade Federal do Ceará Estrada do Cedro Quixadá Brazil Universidade Federal do Ceará Campus do Pici Fortaleza Brazil

ISBN: (纸本)9780982657171

We investigate how to improve cooperative communication between agents by representing knowledge bases as logic programs extended with abduction. In this proposal, agents try to provide explanations whenever they fail to answer a question. Query Relaxation is then employed to search for answers related to the query, characterizing cooperative behavior. Our contributions bring insightful improvements to relaxation attempts and the quality of related answers. We introduce rational explanations and use them to efficiently guide the search for related answers in a relaxation tree.

关键词： abductive logic programming query relaxation

来源：评论

学校读者我要写书评

暂无评论

A logic-Based, Reactive Calculus of Events

引用

FUNDAMENTA INFORMATICAE 2010年第1-2期105卷 135-161页

作者： Chesani, Federico Mello, Paola Montali, Marco Torroni, Paolo Univ Bologna DEIS I-40136 Bologna Italy

Since its introduction, the Event Calculus (EC) has been recognized for being an excellent framework to reason about time and events, and it has been applied to a variety of domains. However, its formalization inside logic-based frameworks has been mainly based on backward, goal-oriented reasoning: given a narrative (also called execution trace) and a goal, logic-based formalizations of EC focus on proving the goal, i.e., establishing if a property (called fluent) holds. These approaches are therefore unsuitable in dynamic environments, where the narrative typically evolves over time: indeed, each occurrence of a new event requires to restart the reasoning process from scratch. Ad-hoc, procedural methods and implementations have been then proposed to overcome this issue. However, they lack a strong formal basis and cannot guarantee formal properties. As a consequence, the applicability of EC has been somehow limited in large application domains such as run-time monitoring and event processing, which require at the same time reactivity features as well as formal properties to provide guarantees about the computed response. We overcome the highlighted issues by proposing a Reactive and logic-based axiomatization of EC, called REC, on top of the SCIFF abductive logic programming framework. Our solution exhibits the features of a reactive verification facility, while maintaining a solid formal background.

关键词： Event Calculus Reactive Reasoning Monitoring Computational logic abductive logic programming

来源：评论

学校读者我要写书评

暂无评论

Declarative Specification and Verification of Service Choreographies

引用

ACM TRANSACTIONS ON THE WEB 2010年第1期4卷 1–62页

作者： Montali, Marco Pesic, Maja van der Aalst, Wil M. P. Chesani, Federico Mello, Paola Storari, Sergio Univ Bologna DEIS I-40136 Bologna Italy Eindhoven Univ Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands Eindhoven Univ Dept Technol Management NL-5600 MB Eindhoven Netherlands Univ Ferrara Dept Engn I-44100 Ferrara Italy

Service-oriented computing, an emerging paradigm for architecting and implementing business collaborations within and across organizational boundaries, is currently of interest to both software vendors and scientists. While the technologies for implementing and interconnecting basic services are reaching a good level of maturity, modeling service interaction from a global viewpoint, that is, representing service choreographies, is still an open challenge. The main problem is that, although declarativeness has been identified as a key feature, several proposed approaches specify choreographies by focusing on procedural aspects, leading to over-constrained and over-specified models. To overcome these limits, we propose to adopt DecSerFlow, a truly declarative language, to model choreographies. Thanks to its declarative nature, DecSerFlow semantics can be given in terms of logic-based languages. In particular, we present how DecSerFlow can be mapped onto Linear Temporal logic and onto abductive logic programming. We show how the mappings onto both formalisms can be concretely exploited to address the enactment of DecSerFlow models, to enrich its expressiveness and to perform a variety of different verification tasks. We illustrate the advantages of using a declarative language in conjunction with logic-based semantics by applying our approach to a running example.

关键词： Languages Management Verification Service choreographies declarative modeling linear temporal logic abductive logic programming conformance checking compliance verification monitoring interoperability reasoning

来源：评论

学校读者我要写书评

暂无评论

An Agent Language with Destructive Assignment and Model-Theoretic Semantics

An Agent Language with Destructive Assignment and Model-Theo...

引用

11th International Workshop on Computational logic in Multi-Agent Systems

作者： Kowalski, Robert Sadri, Fariba Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

ISBN: (纸本)9783642149764

In this paper we present an agent language that combines agent functionality with an action theory and model-theoretic semantics. The language is based on abductive logic programming (ALP), but employs a simplified state-free syntax, with an operational semantics that uses destructive assignment to manipulate a database, which represents the current state of the environment. The language builds upon the ALP combination of logic programs, to represent an agent's beliefs, and integrity constraints, to represent the agent's goals. logic programs are used to define macro-actions, intensional predicates, and plans to reduce goals to sub-goals including actions. Integrity constraints are used to represent reactive rules, which are triggered by the current state of the database and recent agent actions and external events. The execution of actions and the assimilation of observations generate a sequence of database states. In the case of the successful solution of all goals, this sequence, taken as a whole, determines a model that makes the agent's goals and beliefs all true.

关键词： abductive logic programming agent languages model-theoretic semantics

来源：评论

学校读者我要写书评

暂无评论

Distributed abductive Reasoning with Constraints 10

Distributed Abductive Reasoning with Constraints

引用

International workshop on declarative agent languages and technologies

作者： Jiefei Ma Krysia Broda Alessandra Russo Emil Lupu Imperial College London United Kingdom

ISBN: (纸本)9780982657119

abductive inference has many known applications in multi-agent systems including planning, scheduling, policy analysis and sensing data interpretation. However, most abductive frameworks rely on a centrally executed proof procedure whereas many of the application problems are distributed by nature. Confidentiality and communication overhead concerns often preclude agents' knowledge from being centralised. We present in this paper a distributed abductive reasoning framework with a flexible and extensible proof procedure that permits collaborative abductive reasoning between agents over decentralised knowledge. The proof procedure is sound and complete upon termination, and can perform concurrent computation. To the best of our knowledge, this is the first distributed abductive system that can compute non-ground conditional proofs and handle arithmetic constraints.

关键词： multi-agent reasoning abductive logic programming

来源：评论

学校读者我要写书评

暂无评论

abductive reasoning in neural-symbolic systems

引用

TOPOI-AN INTERNATIONAL REVIEW OF PHILOSOPHY 2007年第1期26卷 37-49页

作者： Garcez, Artur S. d'Avila Gabbay, Dov M. Ray, Oliver Woods, John City Univ London Dept Comp London EC1V 0HB England Kings Coll London Dept Comp Sci London WC2R 2LS England Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England Univ British Columbia Dept Philosophy Vancouver BC V6T 1Z4 Canada

Abduction is or subsumes a process of inference. It entertains possible hypotheses and it chooses hypotheses for further scrutiny. There is a large literature on various aspects of non-symbolic, subconscious abduction. There is also a very active research community working on the symbolic (logical) characterisation of abduction, which typically treats it as a form of hypothetico-deductive reasoning. In this paper we start to bridge the gap between the symbolic and sub-symbolic approaches to abduction. We are interested in benefiting from developments made by each community. In particular, we are interested in the ability of nonsymbolic systems (neural networks) to learn from experience using efficient algorithms and to perform massively parallel computations of alternative abductive explanations. At the same time, we would like to benefit from the rigour and semantic clarity of symbolic logic. We present two approaches to dealing with abduction in neural networks. One of them uses Connectionist Modal logic and a translation of Horn clauses into modal clauses to come up with a neural network ensemble that computes abductive explanations in a top-down fashion. The other combines neural-symbolic systems and abductive logic programming and proposes a neural architecture which performs a more systematic, bottom-up computation of alternative abductive explanations. Both approaches employ standard neural network architectures which are already known to be highly effective in practical learning applications. Differently from previous work in the area, our aim is to promote the integration of reasoning and learning in a way that the neural network provides the machinery for cognitive computation, inductive learning and hypothetical reasoning, while logic provides the rigour and explanation capability to the systems, facilitating the interaction with the outside world. Although it is left as future work to determine whether the structure of one of the proposed approaches is m

关键词： abduction abductive logic programming connectionist modal logic neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-agent agreements about actions through argumentation 1

Multi-agent agreements about actions through argumentation

引用

1st International Conference on Computational Models of Argument (COMMA)

作者： Torroni, Paolo Univ Bologna DEIS I-40136 Bologna Italy

ISBN: (纸本)9781586036522

In this work, we propose a declarative multi-agent argumentation framework for reasoning and argument about actions, equipped with a sound operational Model. The foundations of this framework rely oil previous results from ALP and front Dung's studies oil argumentation. Our approach features declarative knowledge representation and logic based reasoning. agent interaction by argumentation dialogues, and a notion of agreement about actions.

关键词： argumentation framework computational logic-based multi-agent systems practical reasoning in MAS abductive logic programming SCIFF IFF

来源：评论

学校读者我要写书评

暂无评论

A hybrid abductive inductive proof procedure

引用

logic JOURNAL OF THE IGPL 2004年第5期12卷 371-397页

作者： Ray, Oliver Broda, Krysia Russo, Alessandra Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

This paper introduces a proof procedure that integrates abductive logic programming (ALP) and Inductive logic programming (ILP) to automate the learning of first order Horn clause theories from examples and background knowledge. The work builds upon a recent approach called Hybrid abductive Inductive Learning (HAIL) by showing how language bias can be practically and usefully incorporated into the learning process. A proof procedure for HAIL is proposed that utilises a set of user-specified mode declarations to learn hypotheses that satisfy a given language bias. A semantics is presented that accurately characterises the intended hypothesis space and includes the hypotheses derivable by the proof procedure. An implementation is described that combines an extension of the Kakas-Mancarella ALP procedure within an ILP procedure that generalises the Progol system of Muggleton. The explicit integration of abduction and induction is shown to allow the derivation of multiple clause hypotheses in response to a single seed example and to enable the inference of missing type information in a way not previously possible.

关键词： abductive logic programming inductive logic programming machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：