Sciweavers

FUIN
2010
93views more  FUIN 2010»
13 years 3 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
FUIN
2010
88views more  FUIN 2010»
13 years 3 months ago
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
Linh Anh Nguyen, Andrzej Szalas
FUIN
2010
103views more  FUIN 2010»
13 years 3 months ago
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
A formal model for diagnostics of biological systems modelled as P systems is presented. We assume the presence of some biologically motivated changes (frequently pathological) in ...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
FUIN
2010
89views more  FUIN 2010»
13 years 3 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
FUIN
2010
97views more  FUIN 2010»
13 years 3 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant
FUIN
2010
94views more  FUIN 2010»
13 years 3 months ago
A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to probabilistic inputs, is appropr...
Salem Benferhat, Didier Dubois, Henri Prade, Mary-...
FUIN
2010
88views more  FUIN 2010»
13 years 3 months ago
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
In this paper we will provide a detailed proof of the solvability of the halting and reachability problem for binary 2-tag systems. We will furthermore prove that an important sub...
Liesbeth De Mol