We present an indexed logical system MALLP(I) for Laurent's multiplicative additive polarized linear logic (MALLP) [14]. The system is a polarized variant of Bucciarelli-Ehrhard's indexed system for multiplica...
详细信息
ISBN:
(纸本)9783540875307
We present an indexed logical system MALLP(I) for Laurent's multiplicative additive polarized linear logic (MALLP) [14]. The system is a polarized variant of Bucciarelli-Ehrhard's indexed system for multiplicative additive linear logic [4]. Our system is derived from a web-based instance of Hamano-Scott's denotational semantics [12] for MALLP. The instance is given by an adjoint pair of right and left multipointed relations. In the polarized indexed system, subsets of indexes for I work as syntactical counterparts of families of points in webs. The rules of MALLP(I) describe (in a proof-theoretical manner) the denotational construction of the corresponding rules of MALLP. We show that MALLP(I) faithfully describes a denotational model of MALLP by establishing a correspondence between the provability of indexed formulas and relations that can be extended to (non-indexed) proof-denotations.
The proceedings contain 38 papers. The topics discussed include: declarative semantics of production rules for integrity maintenance;a local algorithm for incremental evaluation of tabled logic programs;overlapping ru...
详细信息
ISBN:
(纸本)9783540366355
The proceedings contain 38 papers. The topics discussed include: declarative semantics of production rules for integrity maintenance;a local algorithm for incremental evaluation of tabled logic programs;overlapping rules andlogic variables in functional logic programs;reduced certificates for abstraction-carrying code;proving properties of constraint logicprogramming by eliminating existential variables;cooperating answer set programming;improving the ISO prolog standard by analyzing test results;modeling biological networks by action languages via answer set programming;using answer set programming for the automatic compilation of assessment tests;compositional semantics for the procedural interpretation of logic;conductive logicprogramming;deductive spreadsheets using tabled logicprogramming;relaxation of optimized predicates;and semantic property grammars for knowledge extraction from biomedical text.
We introduce the recursive, rule-based RDF query language RDFLog. RDFLog extends previous RDF query languages by arbitrary quantifier alternation: blank nodes may occur in the scope of all, some, or none of the univer...
详细信息
ISBN:
(纸本)9783540887362
We introduce the recursive, rule-based RDF query language RDFLog. RDFLog extends previous RDF query languages by arbitrary quantifier alternation: blank nodes may occur in the scope of all, some, or none of the universal variables of a rule. In addition RDFLog is aware of important RDF features Such as the distinction between blank nodes, literals and URIs or the RDFS vocabulary. The semantics of RDFLog is closed (every answer is all RDF graph), but lifts RDF's restrictions on literal and blank node occurrences for intermediary data. We show how to define a sound and complete operational semantics that call be implemented using existing logicprogramming techniques. Using RDFLog we classify previous approaches to RDF qnerying along their support for blank node construction and show equivalence between languages with full quantifier alternation and languages with only for all there exists rules.
This paper provides a method for estimating states of enzyme reactions in metabolic pathways. We first introduce a new model based on the logical viewpoint of enzyme function. The proposed model logically represents c...
详细信息
This paper provides a method for estimating states of enzyme reactions in metabolic pathways. We first introduce a new model based on the logical viewpoint of enzyme function. The proposed model logically represents causal relations between concentration changes of metabolites and enzyme activities. When we observe the concentration changes of metabolites, we can assume which enzyme reactions are accelerated under the model. This computation can be realized using inductive logicprogramming (ILP), which can find a hypothesis that accounts for given observations with a background theory. In this paper, we use CF-induction, which is an ILP technique and has a unique feature that can integrate inductive and abductive inferences. CF-induction can compute not only possible reaction states that can explain the observations, but also general rules that are missing in the current background theory. Then, we perform experiments with simple metabolic pathways, and confirm that CF-induction can both estimate states of reactions and discover new causal rules.
Single-constrained QoS (Quality of Service) routing protocols have inherent shortcomings when they are applied to ad hoc networks. Only considering a single constraint parameter can't always cope with the problems...
详细信息
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the promise of performance and programmer prod...
详细信息
ISBN:
(纸本)9781605581583
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the promise of performance and programmer productivity. Studies of well-tuned programs have suggested that PGAS languages are effective at utilizing modern networks because their one-sided communication is a good match to the underlying network hardware. An open question is whether the manual optimizations required to achieve good performance can be performed automatically by the compiler in a performance portable manner. In this paper we present a compiler and runtime optimization framework for loops containing communication operations. Our framework performs compile time message vectorization and strip-mining and defers until runtime the selection of the actual communication operations. At runtime, the communication requirements of the program are analyzed, and communication is instantiated and scheduled based on highly tuned network and application performance models. The runtime analysis takes into account network flow control and quality-of-service restrictions, and it is able to select from a large class of available communication primitives the communication schedule best suited for the dynamic combination of input size and system parameters. The results indicate that our framework produces code that scales and performs better than that of manually optimized implementations. Our approach not only improves performance, but increases programmer productivity as well. Copyright 2008 ACM.
This invited talk surveys notions related to synchronization in presence of asynchrony and failures. To the author knowledge, there is currently no textbook in which these notions are pieced together, unified, and pre...
详细信息
This invited talk surveys notions related to synchronization in presence of asynchrony and failures. To the author knowledge, there is currently no textbook in which these notions are pieced together, unified, and presented in a homogeneous way. This talk (that pretends to be neither exhaustive, nor objective) is only a first endeavor in that direction. The notions that are presented and discussed are listed in the keyword list.
We introduce a novel approach to handle location- dependent query processing in location-aware environments. We define a hybrid logic-based query language by building a semantic model that benefits from the well- foun...
详细信息
We introduce a novel approach to handle location- dependent query processing in location-aware environments. We define a hybrid logic-based query language by building a semantic model that benefits from the well- founded model checking techniques. Our language is defined by four modal operators; it can express common location-dependent queries, and has the ability to deal with relative locations. A prototype implementation of the query engine is also presented and will be discussed.
In the business Grid, the owner of a workflow is assumed to ask an SLA Workflow broker to execute the workflow for him. The price for executing a workflow on the Grid is negotiated between the user and the broker. Det...
详细信息
In the business Grid, the owner of a workflow is assumed to ask an SLA Workflow broker to execute the workflow for him. The price for executing a workflow on the Grid is negotiated between the user and the broker. Determining a price that satisfies both, the user and the SLA workflow broker, is a difficult task. This paper proposes a method using bilateral bargaining game model based on fuzzy logic to determine the price that the user and the broker could accept after the first negotiation round. We also analyze many parameters affecting the price determination process. The validation results show that the approach is suitable with business rules.
This paper proposes an improved linguistic quantifier that operates with penalty function so that a set of products can be clustered into hierarchical levels. The method is based on fuzzy approach with an aim at perso...
详细信息
This paper proposes an improved linguistic quantifier that operates with penalty function so that a set of products can be clustered into hierarchical levels. The method is based on fuzzy approach with an aim at personalizing the display of products in an order of personal preference on a set of product attributes. The discriminating power of the system can be flexibly tuned via the set up of quantifier's parameters and the penalty function. Numerical example is given for illustrating the computation, providing comparative results to the existing method and giving some technical insights.
暂无评论