Sciweavers

RULEML
2010
Springer
13 years 11 months ago
Norm Compliance in Business Process Modeling
We investigate the concept of norm compliance in business process modeling. In particular we propose an extension of Formal Contract Logic (FCL), a combination of defeasible logic ...
Guido Governatori, Antonino Rotolo
RR
2010
Springer
13 years 11 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
RR
2010
Springer
13 years 11 months ago
On the Semantic Relationship between Datalog and Description Logics
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
Markus Krötzsch, Sebastian Rudolph, Peter H. ...
PPDP
2010
Springer
13 years 11 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
OOPSLA
2010
Springer
13 years 11 months ago
Modular logic metaprogramming
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are ob...
Karl Klose, Klaus Ostermann
LPAR
2010
Springer
13 years 11 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
LOGCOM
2010
87views more  LOGCOM 2010»
13 years 11 months ago
Exemplaric Expressivity of Modal Logics
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ...
Bart Jacobs, Ana Sokolova
LICS
2010
IEEE
13 years 11 months ago
An Intuitionistic Logic that Proves Markov's Principle
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
Hugo Herbelin
LICS
2010
IEEE
13 years 11 months ago
Polarity and the Logic of Delimited Continuations
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Noam Zeilberger
LICS
2010
IEEE
13 years 11 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche