A(xml(T)) is a logic-based formal language of authorisation for documents written in the Extensible Markup Language. In our previous publication, we addressed the issues of the syntax, semantics, and expressive power ...
详细信息
ISBN:
(纸本)9783642219368
A(xml(T)) is a logic-based formal language of authorisation for documents written in the Extensible Markup Language. In our previous publication, we addressed the issues of the syntax, semantics, and expressive power that it has to specify access control and to query XML encoded data. In this paper, we consider an experimental implementation to test its capability to allow and restrict access to XML documents. The software implementation will allow us to define a security policy base and then reason upon it to determine authorisations. From there we can discover A(xml(T))'s capacity to provide XML access control and any limitations it may have. Also, from this experiment we will have an initial building block for establishing an actual XML access control application.
The proceedings contain 21 papers. The special focus in this conference is on Category Theory and Computer Science. The topics include: Preface;coherence and valid isomorphism in closed categories applications of proo...
ISBN:
(纸本)9783540516620
The proceedings contain 21 papers. The special focus in this conference is on Category Theory and Computer Science. The topics include: Preface;coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer scientist perspective;independence results for calculi of dependent types;quantitative domains, groupoids and linear logic;graded multicategories of polynomial-time realizers;on the semantics of second order lambda calculus: From Bruce-Meyer-Mitchell models to hyperdoctrine models and vice-versa;dictoses;declarative continuations: An investigation of duality in programming language semantics;logicrepresentation in LF: Report on work in progress;unification properties of commutative theories: A categorical treatment;an abstract formulation for rewrite systems;from Petri nets to linear logic;an algebraic view of interleaving and distributed operational semantics for CCS;a dialectica-like model of linear logic;a final coalgebra theorem;temporal structures;compositional relational semantics for indeterminate dataflow networks;operations on records;projections for polymorphic strictness analysis;a category-theoretic account of program modules;a note on categorical datatypes;a set constructor for inductive sets in Martin-Löf's type theory.
We are developing a multilevel metalogicprogramming language that we call Alloy. It is based on first-order predicate calculus extended with metalogical constructs. An Alloy program consists of a collection of theori...
详细信息
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of proposi...
详细信息
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity constraints on this process. We want the transformed program to be equivalent in a strong sense so that theory parts can be transformed independent of the wider context in which they might be embedded. It was only recently established [2] that propositional theories are indeed equivalent (in a strong sense) to logic programs. Here this result is extended with the following contributions. (i) We show how to effectively obtain an equivalent program starting from an arbitrary theory. (ii) We show that in general there is no polynomial transformation if we require the resulting program to share precisely the vocabulary or signature of the initial theory. (iii) Extending previous work we show how polynomial transformations can be achieved if one allows the resulting program to contain new atoms. The program obtained is still in a strong sense equivalent to the original theory, and the answer sets of the theory can be retrieved from it.
We present STARLET, a new compiler compiler which compiles Extended Affix Grammars defining a translation into an executable program : the translator. We look at its operational semantics and we focus on the points wh...
详细信息
In this paper we propose dynamic description logic for formalizing multi-agent cooperation process with a clearly defined syntax and semantics. By combining the features of knowledgerepresentation and reasoning of de...
详细信息
ISBN:
(纸本)9783642033377
In this paper we propose dynamic description logic for formalizing multi-agent cooperation process with a clearly defined syntax and semantics. By combining the features of knowledgerepresentation and reasoning of description logic and action theory for multi-agent interaction, our logic is effective and significant both for static and dynamic environment. On the static side, we employ description logic for the representation and reasoning of beliefs and goals. On the dynamic side, we adopt the object-oriented method to describe actions. The description of each action is composed of models, preconditions and effects. It can reflect the real changes of the world and is very suitable for belief revision and action planning. Based on our logic, we investigate how to form joint goal for multi-agent cooperation. In particular, we propose an effective dynamic planning algorithm for scheduling sub goals, which is greatly crucial for coordinating multi-agent behaviors.
Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides "negation as failure", and its use in deductive data...
详细信息
Specifying efficient evaluation strategies by meta-interpreters, and then eliminating the interpretation overhead by partial evaluation with respect to given object programs, is an elegant technique for the transforma...
详细信息
The availability of automatic support may sometimes determine the successful accomplishment of a process. Such a support can be provided if a model of the intended process is available. Many real-world process models ...
详细信息
We compare two executable languages: the rewriting logic based specification language Maude and the higher-order, lazy, functional programming language Haskell. We compare these languages experimentally on a problem i...
详细信息
暂无评论