the purpose of this paper is to establish some connections between precedent-based reasoning as it is studied in the field of Artificial Intelligence and Law, particularly in the work of Ashley, and two other fields: ...
详细信息
ISBN:
(纸本)9781581131659
the purpose of this paper is to establish some connections between precedent-based reasoning as it is studied in the field of Artificial Intelligence and Law, particularly in the work of Ashley, and two other fields: deontic logic and nonmonotoniclogic. First, a deontic logic is described that allows for sensible reasoning in the presence of conflicting norms. Second, a simplified version of Ashley's account of precedent-based reasoning is reformulated within the framework of this deontic logic. Finally, some ideas from the theory of nonmonotonic inheritance are employed to show how Ashley's account might be elaborated to allow for a richer representation of the process of argumentation.
We have recently started a Couple of spin-off companies which aim at exploiting ASP, and the DLV system in particular, in real-world applications. We briefly report on the first experiences, evidentiating the positive...
详细信息
ISBN:
(纸本)9783642042379
We have recently started a Couple of spin-off companies which aim at exploiting ASP, and the DLV system in particular, in real-world applications. We briefly report on the first experiences, evidentiating the positive aspects of ASP which allowed us to develop some successful applications, and some obstacles which should be overcome to improve ASP systems, and make them best suited for industry-level applications.
this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
ISBN:
(纸本)3540285385
this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. We have used the system to discover some interesting theorems about strong equivalence [Lin and Chen, 2005]. Here we briefly describe how the system can be used to find out whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logicprogramming was introduced withthe aim of presenting the syntax and natural semantics for...
详细信息
ISBN:
(纸本)9783642208942
Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logicprogramming was introduced withthe aim of presenting the syntax and natural semantics for parametrized logic programs, which are very expressive logic programs, in the sense that complex formulas are allowed to appear in the body and head of rules. Stable model semantics was defined for such parametrized logic programs. the aim of this paper is to introduce a parametrized version of equilibrium logicthat extends parametrized logic programs to general theories, and to show how these can be used to characterize and to study strong equivalence of temporal logic programs.
We describe an approach for distributed access control policies that is based on a nonmonotonic semantics and the use of logicprogramming for policy specification and the evaluation of access requests. Our approach a...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
We describe an approach for distributed access control policies that is based on a nonmonotonic semantics and the use of logicprogramming for policy specification and the evaluation of access requests. Our approach allows assertions of relevance to access control to be made by individual agents or on a community-based level and different strengths of testimonial warrant may be distinguished by using various logical operators. We describe a form of ASP that allows for remote access request evaluation and we discuss a DLV-based implementation of our approach.
nonmonotoniclogic is a branch of logicthat has been developed to model situations with incomplete information. We argue that there is a connection between AOP and nonmonotoniclogic which deserves further study. As ...
详细信息
nonmonotoniclogic is a branch of logicthat has been developed to model situations with incomplete information. We argue that there is a connection between AOP and nonmonotoniclogic which deserves further study. As a concrete technical contribution and "appetizer", we outline an AO semantics defined in default logic (a form of nonmonotoniclogic), propose a definition of modular reasoning, and show that the default logic version of the language semantics admits modular reasoning whereas a conventional language semantics based on weaving does not. Copyright 2007 ACM.
We present a formal framework where a nonmonotonic formalism (the action description language C+) is used to provide robots with high-level reasoning, such as planning, in the style of cognitive, robotics. In particul...
详细信息
ISBN:
(纸本)9783642042379
We present a formal framework where a nonmonotonic formalism (the action description language C+) is used to provide robots with high-level reasoning, such as planning, in the style of cognitive, robotics. In particular, we introduce a novel method that bridges the high-level discrete action planning and the low-level continuous behavior by trajectory planning. We show the applicability of this framework oil two LEGO MINDSTORMS NXT robots, in ail action domain that involves concurrent execution of actions that cannot be serialized.
Most complete SAT/ASP solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to its high overhead. In this paper, we show characteri...
详细信息
ISBN:
(纸本)9783540721994
Most complete SAT/ASP solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to its high overhead. In this paper, we show characterizations of the problems for which lookahead is ineffective, and demonstrate, experimentally, that for problems that lie in the phase transition regions, search efficiency can be improved significantly by lookahead. this understanding leads to the proposal of a mechanism called adaptive lookahead, which decides when lookahead should be invoked dynamically upon learned information. Our experiments show that adaptive lookahead adapts well to different situations where lookahead may or may not be beneficial.
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternational C...
详细信息
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternationalconference on Principles of Knowledge Representation and reasoning (KR'08), 411-421;2013b. Proc. of the 12thinternationalconference on logicprogramming and nonmonotonicreasoning (LPNMR'13), 264-276) adapted the well-known AGM framework (Alchourron et al. 1985. Journal of Symbolic logic 50, 2, 510-530) to LP revision. they identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result t
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackl...
详细信息
ISBN:
(纸本)9783642042379
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackles the problem from the perspective of viewing protein structure as a folding of protein sequences in a discrete representation of space (a crystal lattice structure). logicprogramming and constraint programming technologies can be effectively used to provide an elegant and effective Solution.
暂无评论