Results 1 - 10 of 73

Uniform logical characterizations of testing equivalences for nondeterministic, probabilistic and Markovian processes

by Marco Bernardo - In Proc. of the 7th Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2009), volume 253(3) of ENTCS , 2009
"... Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equiva-lence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on s ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
on similar modal languages, each including only true and diamond. Unfortunately, this is not the case with the existing logical char-acterizations of the corresponding variants of testing equivalence, as they are based on different modal languages. In this paper we show that the logical characterizations

Abstract Consistent Query Answers in Inconsistent Databases

by Marcel Arenas, Leopold Bertossi, Catlica Chile, Catlica Chile
"... In this paper we consider the problem of the logical char-acterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A rnethod for computing consistent an-s ..."
Abstract - Add to MetaCart
In this paper we consider the problem of the logical char-acterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A rnethod for computing consistent an

Consistent Query Answers in Inconsistent Databases

by unknown authors
"... Abstract In this paper we consider the problem of the logical char-acterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thisnotion is captured in terms of the possible repaired versions of the database. A method for computing consiste ..."
Abstract - Add to MetaCart
Abstract In this paper we consider the problem of the logical char-acterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thisnotion is captured in terms of the possible repaired versions of the database. A method for computing

VALENTIN GORANKO Refutation Systems in Modal Logic

by unknown authors
"... Abstract. Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic char-acterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedur ..."
Abstract - Add to MetaCart
Abstract. Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic char-acterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision

for Configurable Logic Circuits With Improved Expressive Capability

by Ambipolar Gate-controllable, Sinw Fets, Davide Sacchetto, Yusuf Leblebici, Giovanni De Micheli
"... Abstract—In this letter, we report on the fabrication and char-acterization of ambipolar silicon-nanowire (SiNW) field-effect transistors (FETs) with a double-independent-gate (DIG) struc-ture for polarity control. Several structures are fabricated, show-ing the effectiveness of local back gate to e ..."
Abstract - Add to MetaCart
Abstract—In this letter, we report on the fabrication and char-acterization of ambipolar silicon-nanowire (SiNW) field-effect transistors (FETs) with a double-independent-gate (DIG) struc-ture for polarity control. Several structures are fabricated, show-ing the effectiveness of local back gate

Compatible-Based Conditioning in Interval-Based Possibilistic Logic

by Salem Benferhat, Karim Tabia, Vladik Kreinovich
"... Interval-based possibilistic logic is a flexible setting ex-tending standard possibilistic logic such that each logi-cal expression is associated with a sub-interval of [0, 1]. This paper focuses on the fundamental issue of condi-tioning in the interval-based possibilistic setting. The first part of ..."
Abstract - Add to MetaCart
on the set of all associated compatible possibility distributions. We analyze the ob-tained posterior distributions and provide a precise char-acterization of lower and upper endpoints of the inter-vals associated with interpretations. The second part of the paper provides an equivalent syntactic computation

An approach for Temporal Argumentation Using Labeled Defeasible Logic Programming (`-DeLP)

by Maximiliano C. Budán, Mauro Gómez Lucero, Guillermo R. Simari
"... In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung’s seminal work char-acterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led to ..."
Abstract - Add to MetaCart
In the last decade, several argument-based formalisms have emerged, with application in many areas, such as legal reasoning, autonomous agents and multi-agent systems; many are based on Dung’s seminal work char-acterizing Abstract Argumentation Frameworks (AF). Recent research in the area has led

Descriptive complexity for pictures languages (Extended abstract)

by Etienne Gr, Frédéric Oliveb, Gaétan Richarda
"... This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. • We uniformly generalize to any dimension the characterization by Giammarresi et al. [GRST96] of the class of recognizable picture languages in existential ..."
Abstract - Add to MetaCart
monadic second-order logic. • We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata of any dimension. They are the first machine-independent char-acterizations of complexity classes of cellular automata. Our

An Order-Theoretic Approach to Dynamic Programming: An Exposition∗

by Takashi Kamihigashi , 2013
"... In this note, we discuss an order-theoretic approach to dynamic programming. In particular, we explain how order-theoretic fixed point theorems can be used to establish the existence of a fixed point of the Bellman operator, as well as why they are not sufficient to char-acterize the value function. ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In this note, we discuss an order-theoretic approach to dynamic programming. In particular, we explain how order-theoretic fixed point theorems can be used to establish the existence of a fixed point of the Bellman operator, as well as why they are not sufficient to char-acterize the value function

A method of selection of characters in numerical taxonomy

by Walter J. Le Quesne - Syst. Zool , 1969
"... A method of selecting from a data matrix the characters most likely to lead to valid phy-logenetic conclusions is put forward, based on the concept of a uniquely derived char-acter and its logical consequences. A coefficient of character-state randomness is defined which gives a measure of how far t ..."
Abstract - Cited by 30 (0 self) - Add to MetaCart
A method of selecting from a data matrix the characters most likely to lead to valid phy-logenetic conclusions is put forward, based on the concept of a uniquely derived char-acter and its logical consequences. A coefficient of character-state randomness is defined which gives a measure of how far
Results 1 - 10 of 73