the proceedings contain 3 papers. the topics discussed include: resolving synchronization conflicts in role-based multimodel-synchronization environments;first-class concepts: reifying architectural knowledge beyond t...
ISBN:
(纸本)9781450385428
the proceedings contain 3 papers. the topics discussed include: resolving synchronization conflicts in role-based multimodel-synchronization environments;first-class concepts: reifying architectural knowledge beyond the dominant decomposition;and towards a framework for analyzing context-oriented programming languages.
We introduce differential games for FO logic of graphs, a variant of Ehrenfeucht-Fraïssé games in which the game is played on only one graph and the moves of both players are restricted. We prove that these ...
详细信息
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size. On the other hand, FO cannot express the very simple algor...
详细信息
this paper introduces the full versions of the non-clausal connection provers nanoCoP for first-order classical logic, nanoCoP-i for first-order intuitionistic logic and nanoCoP-M for several first-order multimodal lo...
详细信息
ISBN:
(纸本)9783030860592;9783030860585
this paper introduces the full versions of the non-clausal connection provers nanoCoP for first-order classical logic, nanoCoP-i for first-order intuitionistic logic and nanoCoP-M for several first-order multimodal logics. the enhancements added to the core provers include several techniques to improve performance and usability, such as a strategy scheduling and the output of a detailed non-clausal connection proof for all covered logics. Experimental evaluations for all provers show the effectiveness of the integrated optimizations.
Network security policies provide high-level directives regarding acceptable and unacceptable use of the network. Organizations specify these high-level directives in policy documents written using human-readable natu...
详细信息
ISBN:
(纸本)9780738113302
Network security policies provide high-level directives regarding acceptable and unacceptable use of the network. Organizations specify these high-level directives in policy documents written using human-readable natural language. the challenge is to convert these natural language policies to the network configurations/specifications needed to enforce the policy. Network administrators, who are responsible for enforcing the policies, typically translate the policies manually, which is a challenging and error-prone process. As a result, network operators (as well as the policy authors) often want to verify that network policies are being correctly enforced. In this paper, we propose Network Policy Conversation Engine (NPCE), a system designed to help network operators (or policy writers) interact withthe network using natural language (similar to the language used in the network policy statements themselves) to understand whether policies are being correctly enforced. the system leverages emerging big data collection and analysis techniques to record flow and packet level activity throughout the network that can be used to answer users policy questions. the system also takes advantage of recent advances in Natural Language Processing (NLP) to translate natural language policy questions into the corresponding network queries. To evaluate our system, we demonstrate a wide range of policy questions - inspired by actual networks policies posted on university websites - that can be asked of the system to determine if a policy violation has occurred.
In a previous paper, we have reported a new linear time correctness condition for proof nets of Multiplicative Linear logic without units, where we gave a description of the algorithm in an informal way. In this paper...
详细信息
ISBN:
(纸本)9783030684457;9783030684464
In a previous paper, we have reported a new linear time correctness condition for proof nets of Multiplicative Linear logic without units, where we gave a description of the algorithm in an informal way. In this paper, we give a formal model for the algorithm. Our formal model is based on a finite state transition system with queues as well as union-find trees as data structures. the model has been obtained by trial and error based on a concrete implementation of the algorithm. In addition, the algorithm has a subtle mechanism in order to avoid deadlock. We give an invariant property of the state transition system and it guarantees the deadlock-freedom.
this conceptual paper aims to analyze, theoretically, the role of incubators in the process of cocreation of value in social innovations based on Service-Dominant logic (SDL) and the Triple Helix Approach. the relatio...
详细信息
Description logics (DLs) support so-called anonymous objects, which significantly contribute to the expressiveness of these KR languages, but also cause substantial computational challenges. this paper investigates re...
详细信息
Context-aware systems keep on emerging in all of our daily activities. To cope withthis new situation, programming languages were extended to support the notion of context. Although context-oriented programming langu...
详细信息
Converting source code from one programming language to another is a problem that occurs regularly in real life, but has attracted limited attention and has not been investigated systematically. this paper presents th...
详细信息
暂无评论