We propose a novel formal framework (called 3D-NCDC-ASP) to represent and reason about cardinal directions between extended objects in 3-dimensional (3D) space, using Answer Set programming (ASP). 3D-NCDC-ASP extends ...
详细信息
We propose a novel formal framework (called 3D-NCDC-ASP) to represent and reason about cardinal directions between extended objects in 3-dimensional (3D) space, using Answer Set programming (ASP). 3D-NCDC-ASP extends Cardinal Directional Calculus (CDC) with a new type of default constraints, andNCDC-ASP to 3D. 3D-NCDC-ASP provides a flexible platform offering different types of reasoning: nonmonotonicreasoning with defaults, checking consistency of a set of constraints on 3D cardinal directions between objects, explaining inconsistencies, and inferring missing CDC relations. We prove the soundness of 3D-NCDC-ASP, and illustrate its usefulness with applications.
Despite the obvious relevance of plausible reasoning to real-world problem solving, nonmonotoniclogics are rarely used in commercial applications or large- scale commonsense reasoning systems. this is largely because...
ISBN:
(纸本)3540667490
Despite the obvious relevance of plausible reasoning to real-world problem solving, nonmonotoniclogics are rarely used in commercial applications or large- scale commonsense reasoning systems. this is largely because few efficient algorithms and tools have thus far been developed.
A general framework for revision of nonmonotonictheories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision ...
详细信息
ISBN:
(纸本)3540632557
A general framework for revision of nonmonotonictheories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision by contraction is not possible whenever the intended semantics satisfies Weak Cut and revision by expansion fails whenever Weak (Cautious) Monotony fails. Furthermore, it turns out that revision by expansion can be used to test whether the framework can be applied successfully and we analyse the case for logicprogramming.
At the occasion of the third internationalconference on Principles of Knowledge Representation and reasoning [1] in 1992, Ray Reiter delivered an invited talk entitled "Twelve Years of nonmonotonicreasoning Res...
详细信息
Four-valued semantics is applied to a deduction basis for granular reasoning with zooming operation. this enables the granular reasoning useful for the foundation of reasoning for incomplete and inconsistent informati...
详细信息
ISBN:
(纸本)9781538626337
Four-valued semantics is applied to a deduction basis for granular reasoning with zooming operation. this enables the granular reasoning useful for the foundation of reasoning for incomplete and inconsistent information. We interpret the semantics of zooming operation with four-valued semantics based on partial interpretation and construct a deductive system with Belnap's four-valued logic. We also discuss an application with non-monotonic reasoning and paraconsistent logic using the zooming technique for frame problem.
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets corres...
详细信息
ISBN:
(纸本)9783642042379
We introduce a general approach to cryptographic protocol verification based oil answer set programming. In our approach, cryptographic protocols are represented as extended logic programs where the answer Sets correspond to traces of protocol runs. Using queries, we can find attacks on a protocol by finding the answer sets for the corresponding logic program. Our encoding is modular, with different modules representing the message passing environment, the protocol Structure and the intruder model. We can easily tailor each module to suit a specific application, while keeping the rest of the encoding constant. As such. our approach is more flexible and elaboration tolerant than related formalizations. the present system is intended as a first step towards the development of a compiler from protocol specifications to executable programs: such a compiler would make verification a completely automated process. this work is also part of a larger project in which we are exploring the advantages of explicit, declarative representations of protocol verification problems.
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and ...
详细信息
ISBN:
(纸本)3540667490
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
暂无评论