In recent years, the declarative programming philosophy has had a visible impact oil new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of forma...
详细信息
ISBN:
(纸本)9783540899815
In recent years, the declarative programming philosophy has had a visible impact oil new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of forma;verification for systems specified using declarative languages, focusing in particular on the Business Process Management field. We propose a verification method based on the g-SCIFF abductive logicprogramming proof procedure and evaluate our method empirically, by comparing its performance withthat of other verification frameworks.
In his article A Wake-Up Call for the logicprogramming Community, published in the December 2007 issue of the ALP Newsletter, the first author raised concerns about the viability of the Prolog programming language in...
详细信息
We present reductions from Dung's argumentation framework (AF) and generalizations thereof to logic programs under the answer-set semantics. the reduction is based on a fixed disjunctive datalog program (the inter...
详细信息
In this paper we propose an extension of Answer Set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium...
详细信息
In this paper we propose an extension of Answer Set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.
Traditional protection mechanisms rely on the characterization of requesters by identity. this is adequate in a closed system with a known set of users but it is not feasible in open environments such as the Web. wher...
详细信息
ISBN:
(纸本)9783540899815
Traditional protection mechanisms rely on the characterization of requesters by identity. this is adequate in a closed system with a known set of users but it is not feasible in open environments such as the Web. where, parties may get, in touch Without being, previously known to each other. In such cases policy-driven negotiation protocols have emerged as a possible solution to enforce security oil future web applications. Along withthis setting, We illustrate PROTUNE a, system for specifying and cooperatively enforcing, security and privacy policies (as well as other kinds of policies). PROTUNE relies on logicprogramming for representing policies and for reasoning with and about them.
We introduce a new programming language construct, Interactors, supporting the agent-oriented view that programming is a dialog between simple, self-contained, autonomous building blocks. We define Interactors as an a...
详细信息
ISBN:
(纸本)9783540899815
We introduce a new programming language construct, Interactors, supporting the agent-oriented view that programming is a dialog between simple, self-contained, autonomous building blocks. We define Interactors as an abstraction of answer generation and refinement in logic Engines resulting in expressive language extension and metaprogramming patterns. Interactors extend language contructs like Ruby. Python and C#'s multiple coroutining block returns through yield statements and they call emulate the action of monadic constructs and catamorphisms ill functional languages. the full version of this paper [1] describes source level emulation of dynamic database and various, built-ins in terms of an Interactor API and design patterns for algorithms involving, combinatorial generation and infinite answer streams.
In this paper we present a new constraint solver for the automated generation of test, cases from specifications. them specification language is inspired by the contract-oriented programming extended with a finite, st...
详细信息
ISBN:
(纸本)9783540899815
In this paper we present a new constraint solver for the automated generation of test, cases from specifications. them specification language is inspired by the contract-oriented programming extended with a finite, state machines. Beyond the generation of correct argument values for method Calls! we generate full test, scenarios thanks to the symbolic animation of the specifications. We propose a flexible CSP architecture that can operate not only on integer or bounded domains but also on arbitrary types. An original notion of type builder is used to establish the link between the type semantics and the CSP framework. We illustrate this with a string builder that, call automatically generate string. instances depending oil combinations of constraints.
logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logicprogramming. the semantics of an LPAD is given in terms of well founded models of the normal logic programs obtain...
详细信息
ISBN:
(纸本)9783540899815
logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logicprogramming. the semantics of an LPAD is given in terms of well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. the paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is based on SLG resolution for normal logic programs. SLGAD is evaluated on classical benchmarks for well founded semantics inference algorithms, namely the stalemate game and the ancestor relation. SLGAD is compared with Cilog2 and SLDNFAD, an algorithm based on SLDNF, on the programs that are modularly acyclic. the results show that SLGAD deals correctly with cyclic programs and, even if it is more expensive than SLDNFAD on problems where SLDNFAD succeeds, is faster than Cilog2 when the query is true in an exponential number of instances.
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of it...
详细信息
ISBN:
(纸本)9783540899815
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its groundingto the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can be characterized by a formula of a simple syntactic form.
In this paper we propose an extension of Answer Set programming (ASP) [1], and in particular, of its most general logical counterpart, Quantified Equilibrium logic (QEL) [2], to deal with partial functions. Although t...
详细信息
ISBN:
(纸本)9783540899815
In this paper we propose an extension of Answer Set programming (ASP) [1], and in particular, of its most general logical counterpart, Quantified Equilibrium logic (QEL) [2], to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature [3]. We argue that this choice yields some counterintuitive effects from a logicprogramming and knowledge representation point of view. We then propose a variant called QEL=(F) where the set of functions is partitioned into partial and Herbrand functions (we also call constructors). In the rest of the paper, we show a direct connection to Scott's logic of Existence [4] and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets with any standard ASP solver.
暂无评论