Titlebook: Rules and Reasoning; International Joint Stefania Costantini,Enrico Franconi,Dumitru Roman Conference proceedings 2017 Springer Internatio

Ruptured-Disk

pus840

Verifying Controllability of Time-Aware Business Processes,bject to linear constraints over the integers. We assume that some of the durations are ., that is, they can be determined by the organization that enacts the process, while others are ., that is, they are determined by the external world..Then, we consider . properties, which guarantee the completi

泰然自若

A Decidable Confluence Test for Cognitive Models in ACT-R,hought – Rational (ACT-R) is a rule-based cognitive architecture that offers a widely employed framework to build such models. There is a sound and complete embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis techniques from CHR can be used to reason about computational propert

pantomime

On the Chase for All Provenance Paths with Existential Rules, all minimal provenance paths of the query (i.e. the sequence of rule applications that generates an atom from a given set of facts). Obtaining all minimal provenance paths of a query using forward chaining can be challenging due to the simplifications done during the rule applications of different

GRAIN

并入

Fast ABox Consistency Checking Using Incomplete Reasoning and Caching,onstraints of soundness and/or completeness is often an approach to practical solutions. In this paper, we propose an extension of incomplete reasoning methods for checking the consistency of a large number of ABoxes against a given TBox. In particular, we use and extend the clash queries proposed b

和平主義者

An Online Tool for Tuning Fuzzy Logic Programs,ruth degrees on their bodies. In this work we describe an efficient online tool which helps to select such operators and weights in an automatic way, accomplishing with our recent technique for tuning this kind of fuzzy programs. The system offers a comfortable interaction with users for introducing

nocturnal

Hybrid ASP-Based Approach to Pattern Mining,ided criteria; typically, all patterns that satisfy certain criteria are considered relevant. Rule-based languages like Answer Set Programming (ASP) seem well-suited for specifying such criteria in a form of constraints. Although progress has been made, on the one hand, on solving individual mining

看法等

Generalize

ArgQL: A Declarative Language for Querying Argumentative Dialogues,based on Cypher (language for graph databases) and SPARQL 1.1 and is adjusted for querying dialogues, composed by sets of arguments and their interrelations. We use formal semantics to show how queries in ArgQL match against data in the argumentation model. The execution is realized by translating b