8-12 July 1997, Leuven, Belgium the internationalconference on logicprogramming is the main annual conference sponsored by the Association for logicprogramming. It covers the latest research in areas such as theore...
8-12 July 1997, Leuven, Belgium the internationalconference on logicprogramming is the main annual conference sponsored by the Association for logicprogramming. It covers the latest research in areas such as theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, non-monotonicreasoning, and logicprogramming and the Internet.
Self-adaptive systems have received great attention in the last decade. In the context of self-adaptive systems, adaptive security concerns with adjusting protection mechanisms at runtime while changes occur in the op...
详细信息
ISBN:
(纸本)9781467388450
Self-adaptive systems have received great attention in the last decade. In the context of self-adaptive systems, adaptive security concerns with adjusting protection mechanisms at runtime while changes occur in the operating environment. One of the challenges with self-adaptation paradigm is that the reasoning engine must leverage existing requirements and constraints and at the same time deal with different types of imperfections due to absence of knowledge or data. the problem arises when the existing runtime requirements models offer no explicit support for imperfections. By imperfections, we mean the values of some attributes of interest are not available at certain points. To address this problem, we propose uncertain reasoning based on imperfect requirements using non-monotoniclogic. We model security requirements, system executions and changes in operation environment through non-monotoniclogicthat explicitly represents imperfect information and accounts for uncertainty.
the rule-based programming paradigm is omnipresent in a number of engineering domains. However, there are some fundamental semantical differences between it and classic programming approaches. No generic solution for ...
详细信息
ISBN:
(纸本)9783642006746
the rule-based programming paradigm is omnipresent in a number of engineering domains. However, there are some fundamental semantical differences between it and classic programming approaches. No generic solution for using rules to model business logic in classic software has been provided so far. In this paper a new approach for Generalized Rule-based programming (GREP) is given. It is based on the use of an advanced rule representation called XTT, which includes an extended attribute-based language, a non-monotonic inference strategy, with an explicit inference control at the rule level. the paper shows, how some typical programming constructs, as well as classic programs can be modelled withthis approach. the paper also presents possibilities of an efficient integration of this technique with existing software systems. It describes the so-called Hybrid Operators in Prolog - a concept which extends the Generalized Rule Based programming Model (GREP). this extension allows a GREP-based application to communicate withthe environment by providing input/output operations, user interaction, and process synchronization. Furthermore, it allows for integration of such an application with contemporary software technologies including Prolog-based code. the proposed Hybrid Operators extend GREP forming a knowledge-based software development concept.
Domains, such as Ambient Intelligence and Social Networks, are characterized by some common features including distribution of the available knowledge, entities with different backgrounds, viewpoints and operational e...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Domains, such as Ambient Intelligence and Social Networks, are characterized by some common features including distribution of the available knowledge, entities with different backgrounds, viewpoints and operational environments, and imperfect knowledge. Multi-Context Systems (MCS) has been proposed as a natural representation model for such environments, while recent studies have proposed adding non-monotonic features to MCS to address the issues of incomplete, uncertain and ambiguous information. In previous works, we introduced a non-monotonic extension to MCS and an argument-based reasoning model that handle imperfect context information based on defeasible argumentation. Here we propose alternative variants that integrate features such as partial preferences, ambiguity propagating and team defeat, and study the relations between the different variants in terms of conclusions being drawn in each case.
In complex reasoning tasks, as expressible by Answer Set programming (ASP), problems often permit for multiple solutions. In dynamic environments, where knowledge is continuously changing, the question arises how a gi...
详细信息
In complex reasoning tasks, as expressible by Answer Set programming (ASP), problems often permit for multiple solutions. In dynamic environments, where knowledge is continuously changing, the question arises how a given model can be incrementally adjusted relative to new and outdated information. this paper introduces Ticker, a prototypical engine for well-defined logical reasoning over streaming data. Ticker builds on a practical fragment of the recent rule-based language LARS, which extends ASP for streams by providing flexible expiration control and temporal modalities. We discuss Ticker's reasoning strategies: first, the repeated one-shot solving mode calls Clingo on an ASP encoding. We show how this translation can be incrementally updated when new data is streaming in or time passes by. Based on this, we build on Doyle's classic justification-based truth-maintenance system to update models of non-stratified programs. Finally, we empirically compare the obtained evaluation mechanisms.
In logic programs, negation-as-failure has been used both for representing negative information and for providing default non-monotonic inference. In this paper we argue that this twofold role is not only unnecessary ...
详细信息
ISBN:
(纸本)3540482814
In logic programs, negation-as-failure has been used both for representing negative information and for providing default non-monotonic inference. In this paper we argue that this twofold role is not only unnecessary for the expressiveness of the language, but it also plays against declarative programming, especially if further negation symbols such as strong negation are also available. We therefore propose a new logicprogramming approach in which negation and default inference are independent, orthogonal concepts. Semantical characterization of this approach is given in the style of answer sets, but other approaches are also possible. Finally, we compare them withthe semantics for logic programs with two kinds of negation.
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonicreasoning. Similar to other closely-related problemsolving technologies, such as SAT/S...
详细信息
Complex Event Recognition (CER) systems detect event occurrences in streaming time-stamped input using predefined event patterns. logic-based approaches are of special interest in CER, since, via Statistical Relationa...
详细信息
ISBN:
(纸本)9780999241172
Complex Event Recognition (CER) systems detect event occurrences in streaming time-stamped input using predefined event patterns. logic-based approaches are of special interest in CER, since, via Statistical Relational AI, they combine uncertainty-resilient reasoning with time and change, with machine learning, thus alleviating the cost of manual event pattern authoring. We presentWOLED, a system based on Answer Set programming (ASP), capable of probabilistic reasoning with complex event patterns in the form of weighted rules in the Event Calculus, whose structure and weights are learnt online. We compare our ASP-based implementation with a Markov logic-based one and with a crisp version of the algorithm that learns unweighted rules, on CER datasets for activity recognition, maritime surveillance and fleet management. Our results demonstrate the superiority of our novel implementation, both in terms of efficiency and predictive performance.
In a recent paper Lakemeyer and Levesque proposed a first-order logic of limited belief to characterize the beliefs of a knowledge base (KB). Among other things, they show that their model of belief is expressive, eve...
详细信息
ISBN:
(纸本)9780999241172
In a recent paper Lakemeyer and Levesque proposed a first-order logic of limited belief to characterize the beliefs of a knowledge base (KB). Among other things, they show that their model of belief is expressive, eventually complete, and tractable. this means, roughly, that a KB may consist of arbitrary first-order sentences, that any sentence which is logically entailed by the KB is eventually believed, given enough reasoning effort, and that reasoning is tractable under reasonable assumptions. One downside of the proposal is that epistemic states are defined in terms of sets of clauses, possibly containing variables, giving the logic a distinct syntactic flavour compared to the more traditional possible-world semantics found in the literature on epistemic logic. In this paper we show that the same properties as above can be obtained by defining epistemic states as sets of three-valued possible worlds. this way we are able to shed new light on those properties by recasting them using the more familiar notion of truth over possible worlds.
Standard game theory models implicitly assume that all significant aspects of a game (payoffs, moves available, etc.) are common knowledge among the players. there are well-known techniques going back to Harsanyi [4] ...
详细信息
暂无评论