Preference models lie at the core of the formalization for several related notions, such as non-monotonic reasoning, obligations, goals, beliefs, etc. Recently, the interest in integrating dynamic operators in the log...
详细信息
Preference models lie at the core of the formalization for several related notions, such as non-monotonic reasoning, obligations, goals, beliefs, etc. Recently, the interest in integrating dynamic operators in the logics of belief, preference and obligation has gained momentum. this integration sheds light on similarities among several change operations traditionally studied independently of each other. While a prolific approach, important operations, such as the well-known contraction of beliefs or derogation of norms studied in the AGM tradition, have not received proper attention in this framework. In this work, we study codifications of contraction operations, stemming from the work on iterated belief change, in the logic of preferences, by means of both semantically defined operations and their counterpart in syntactical priority structures.
Planning as programming is an approach to automated planning, where the planning domain model is expressed as a program in some (declarative) programming language. then the modeler can exploit all features of that lan...
详细信息
Strategy logic (SL) is a well established formalism for strategic reasoning in multi- agent systems. In a nutshell, SL is built over LTL and treats strategies as fi rst- order objects that can be associated with agent...
详细信息
ISBN:
(纸本)9781450342391
Strategy logic (SL) is a well established formalism for strategic reasoning in multi- agent systems. In a nutshell, SL is built over LTL and treats strategies as fi rst- order objects that can be associated with agents by means of a binding operator. In this work we introduce Graded Strategy logic (Graded SL), an extension of SL by graded quanti fi ers over tuples of strategy variables such as \ there exist at least g di ff erent tuples (x(1);...;x(n)) of strategies". We study the model- checking problem of Graded-SL and prove that it is no harder than for SL, i. e., it is non- elementary in the quanti fi er rank. We show that Graded-SL allows one to count the number of di ff erent strategy pro fi les that are Nash equilibria (NE), or subgame- perfect equilibria (SPE). By analyzing the structure of the speci fi c formulas involved, we conclude that the important problems of checking for the existence of a unique NE or SPE can both be solved in 2 ExpTime, which is not harder than merely checking for the existence of such equilibria.
Algorithms based on first-order knowledge compilation are currently the state-of-the-art for lifted inference. these algorithms typically compile a probabilistic relational model into an intermediate data structure an...
详细信息
We introduce the logic of Here-and-there with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set programming (ASP). this allows for assigning default values to const...
详细信息
We introduce the logic of Here-and-there with Constraints in order to capture constraint theories in the non-monotonic setting known from Answer Set programming (ASP). this allows for assigning default values to constraint variables or to leave them undefined. Also, it provides us with a semantic framework integrating ASP and Constraint Processing in a uniform way. We put some emphasis on logic programs dealing with linear constraints on integer variables, where we further introduce a directional assignment operator. We elaborate upon the formal relation and implementation of these programs in terms of Constraint ASP, sketching an existing system.
Probabilistic logics, especially those based on logicprogramming (LP), are gaining popularity as modelling and reasoning tools, since they combine the power of logic to represent knowledge withthe ability of probabi...
详细信息
Probabilistic logics, especially those based on logicprogramming (LP), are gaining popularity as modelling and reasoning tools, since they combine the power of logic to represent knowledge withthe ability of probability theory to deal with uncertainty. In this paper, we propose a hybrid extension for probabilistic logicprogramming, which allows for exact inference for a much wider class of continuous distributions than existing extensions. At the same time, our extension allows one to compute approximations with bounded and arbitrarily small error. We propose a novel anytime algorithm exploiting the logical and continuous structure of distributions and experimentally show that our algorithm is, for typical relational problems, competitive with state-of-the-art sampling algorithms and outperforms them by far if rare events with deterministic structure are provided as evidence, despite the fact that it provides much stronger guarantees.
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. A detailed complexity analysis of coherence ...
详细信息
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. A detailed complexity analysis of coherence testing and cautious reasoning under the new semantics highlighted similarities and differences versus mainstream stable model semantics for aggregates, which eventually led to the design of compilation techniques for implementing the new semantics on top of existing ASP solvers.
In information security, representation and reasoning of authorization policy has been a key research topic in this field especially in a sophisticated information sharing and exchange environment [6, 7, 9]. In such a...
详细信息
ISBN:
(纸本)9781943436040
In information security, representation and reasoning of authorization policy has been a key research topic in this field especially in a sophisticated information sharing and exchange environment [6, 7, 9]. In such a scenario, an user's request to access the system may not be able to decide straightaway, it may initiate a sequence of complex executions of authorization commands in order to determine either to grant or deny such a request. Becker and Nanz's logic of State-Modifying Policies (SMP) is a formal system addressing such problem in access control. In this paper, we provide a declarative semantics for SMP through a translation from SMP to Answer Set programming (ASP) and propose a system prototype to implement our approach. Our experimental results show that our ASP implementation for SMP reasoning is effective to deal with real world problem domains. Copyright ISCA, CAINE 2016.
On the one hand, pesticides may be absorbed into the body orally, dermally, ocularly and by inhalation and the human exposure may be dietary, recreational and/or occupational where toxicity could be acute or chronic. ...
详细信息
ISBN:
(纸本)9783319446721;9783319446714
On the one hand, pesticides may be absorbed into the body orally, dermally, ocularly and by inhalation and the human exposure may be dietary, recreational and/or occupational where toxicity could be acute or chronic. On the other hand, the environmental fate and toxicity of the pesticide is contingent on the physico-chemical characteristics of pesticide, the soil composition and adsorption. Human toxicity is also dependent on the exposure time and individual's susceptibility. therefore, this work will focus on the development of an artificialintelligence based diagnosis support system to assess the pesticide toxicological risk to humanoid, built under a formal framework based on logicprogramming to knowledge representation and reasoning, complemented with an approach to computing grounded on artificial Neural Networks. the proposed solution is unique in itself, once it caters for the explicit treatment of incomplete, unknown, or even self-contradictory information, either in terms of a qualitative or quantitative setting.
the well known Aristotelian syllogistic system S consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in tau = [ 0,1]. the truth ratio of a particular mood...
详细信息
ISBN:
(数字)9783319420073
ISBN:
(纸本)9783319420073;9783319420066
the well known Aristotelian syllogistic system S consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in tau = [ 0,1]. the truth ratio of a particular mood is calculated by relating the number of true and false syllogistic cases that the mood matches. the introduction of (n -1) fuzzy existential quantifiers, extends the system to fuzzy-syllogistic systems S-n, 1 < n, of which every fuzzy-syllogistic mood can be interpreted as a vague inference with a generic truth ratio, which is determined by its syllogistic structure. Here we introduce two new concepts, the relative truth ratio (r)tau = [ 0,1] that is calculated from the cardinalities of the syllogistic cases of the mood and fuzzy-syllogistic ontology (FSO). We experimentally apply the fuzzy-syllogistic systems S-2 and S-6 as underlying logic of a FSO reasoner (FSR) and discuss sample cases for approximate reasoning.y
暂无评论