the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applicati...
ISBN:
(纸本)9783642396656
the proceedings contain 26 papers. the topics discussed include: inconsistency management for description logic programs and beyond;reasoning about pattern-based XML queries;answer set programming: language, applications and development tools;a variant of earley deduction with partial evaluation;verification and synthesis in description logic based dynamic systems;towards an efficient algorithm to reason over description logics extended with nominal schemas;computing incoherence explanations for learned ontologies;an ontology-based reasoning approach for electric power utilities;conjunctive queries with negation over DL-lite: a closer look;on the exploration of the query rewriting space with existential rules;incomplete information in RDF;RIO: minimizing user interaction in ontology debugging;and eliminating nonmonotonic DL-atoms in description logic programs.
Computational Indistinguishability logic (CIL) is a logic for reasoning about cryptographic primitives in computational model. It is sound for standard model, but also supports reasoning in the random oracle and other...
详细信息
ISBN:
(数字)9783642412271
ISBN:
(纸本)9783642412271;9783642412264
Computational Indistinguishability logic (CIL) is a logic for reasoning about cryptographic primitives in computational model. It is sound for standard model, but also supports reasoning in the random oracle and other idealized models. We illustrate the benefits of CIL by formally proving the security of a Password-Based Key Exchange (PBKE) scheme, which is designed to provide entities communicating over a public network and sharing a short password, under a session key.
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine common...
详细信息
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized comple...
ISBN:
(纸本)9783642287169
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized complexity and fixed-parameter tractability of description logicreasoning;enfragmo: a system for modeling and solving search problems withlogic;automated and human proofs in general mathematics: an initial comparison;lazy abstraction with interpolants for arrays;backward trace slicing for conditional rewrite theories;forgetting for defeasible logic;solving language equations and disequations with applications to disunification in description logics and monadic set constraints;dual-priced modal transition systems with time durations;finding finite herbrand models;and monitor-based statistical model checking for weighted metric temporal logic.
Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they t...
详细信息
ISBN:
(纸本)9783642405648
Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they tend to fail for densely connected computing platforms. this paper proposes an automated system design approach employing Answer Set programming (ASP). ASP provides a stringent semantics, allowing for an efficient representation of routing options. An automotive case-study illustrates that the proposed ASP-based system design approach is competitive for sparsely connected computing platforms, while it outperforms SAT-based approaches for dense Networks-on-Chip by an order of magnitude.
Although several proposals to combine description logics withlogicprogramming rules have been brought forward, hardly any of these approaches capture the dynamic nature of the Semantic Web. In this paper, we look at...
详细信息
Minimalist Grammars (MG) are viewed as a resource consuming system where syntactic operations are triggered when a positive form of a feature matches with its negative form. But a problem arises when a feature lacks a...
详细信息
Minimalist Grammars (MG) are viewed as a resource consuming system where syntactic operations are triggered when a positive form of a feature matches with its negative form. But a problem arises when a feature lacks a positive/negative value. For the latter case, we introduce a default inference rule in order to account for the underspecification of the feature in a lexical entry.
Contract-based design enriches a component model with properties structured in pairs of assumptions and guarantees. these properties are expressed in term of the variables at the interface of the components, and speci...
详细信息
ISBN:
(纸本)9781479902156
Contract-based design enriches a component model with properties structured in pairs of assumptions and guarantees. these properties are expressed in term of the variables at the interface of the components, and specify how a component interacts with its environment: the assumption is a property that must be satisfied by the environment of the component, while the guarantee is a property that the component must satisfy in response. Contract-based design has been recently proposed in many methodologies for taming the complexity of embedded systems. In fact, contract-based design enables stepwise refinement, compositional verification, and reuse of components. However, only few tools exist to support the formal verification underlying these methods. OCRA (Othello Contracts Refinement Analysis) is a new tool that provides means for checking the refinement of contracts specified in a linear-time temporal logic. the specification language allows to express discrete as well as metric real-time constraints. the underlying reasoning engine allows checking if the contract refinement is correct. OCRA has been used in different projects and integrated in CASE tools.
Ontology-based reasoning is considered a crucial task in the area of knowledge management. In this context, the interest in approaches that resort to Datalog (and its extensions) for implementing various reasoning tas...
详细信息
暂无评论