enter search term and/or author name
Epistemic Strategies and Games on Concurrent Processes
Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden
Article No.: 28
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to...
Translating to Co-Büchi Made Tight, Unified, and Useful
Udi Boker, Orna Kupferman
Article No.: 29
We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi...
Multiple Belief Change extends the classical AGM framework for Belief Revision introduced by Alchourron, Gardenfors, and Makinson in the early ’80s. The extended framework includes epistemic input represented as a (possibly infinite) set...
We study fragments D(k∀) and D(k-dep) of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of...
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
Ewa Madalińska-Bugaj, Linh Anh Nguyen
Article No.: 32
We generalize the QSQR evaluation method to give the first set-oriented depth-first evaluation method for Horn knowledge bases. The resulting procedure closely simulates SLD-resolution (to take advantages of the goal-directed approach) and highly...
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
Steven Schockaert, Jeroen Janssen, Dirk Vermeir
Article No.: 33
In this article, we introduce fuzzy equilibrium logic as a generalization of both Pearce equilibrium logic and fuzzy answer set programming. The resulting framework combines the capability of equilibrium logic to declaratively specify search...
We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes, and tests for (in)equality of attributes’ values. We prove that this problem is decidable, EXPTIME-complete....