We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents’ knowledge in multi-agent contexts, such as “agent a knows as much as agent b”. We analyse the expressiveness of EQBL through a translation into monadic second-order logic, and provide complete...

—In this paper, we examine and compare De Morgan-, Kleene-, and Boolean-disjunctive and conjunctive normal forms and consider their role in fuzzy settings. In particular, we show that there are normal forms and truth tables for classical fuzzy propositional logic and intervalvalued fuzzy propositional logic that are completely analogous to those for Boolean propositional logic. Thus, determinin...

We establish a framework to integrate propositional logic with first-order logic. This is done in such a way that it optionally appears either as first-order logic over a Boolean algebra or as propositional logic including Boolean quantification. We describe and prove complexity bounds for extended quantifier elimination by virtual substitution for our theory. This extended quantifier eliminati...

We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...

What is fuzzy logic? Fuzzy logic is an extension of Boolean logic which allows intermediate values between True and False. As in Boolean logic, a true statement is expressed by the value “1” and a false statement by the value “0”. However, unlike in probability theory, the value must not be interpreted as a confidence level but rather as a Membership Function (MF). Therefore, every statement is...

The accepted wisdom is that combinational circuits must have acyclic (i.e., loop-free or feed-forward) topologies. And yet simple examples suggest that this need not be so. Prior work advocated the design of cyclic combinational circuits (i.e., circuits with loops or feedback paths). A methodology was proposed for optimizing circuits by introducing cycles at the technologyindependent stage of s...

Multi-Domain Logic (MDL) is a generalization of signed logic, in which every variable has its own domain. This aspect increases the efficiency of direct solving of MDL satisfiability, because the solving process proceeds by reducing the size of the domains (contradiction appears as an empty domain). In contrast to the usual approach of translating signed logic satisfiability into boolean satisf...

We examine oscillation behavior of normal logic programs. Both the Gelfond-Lifschitz operator and the TP operator are used to update Herbrand interpretations, and any interpretation finally reaches in an oscillator. It has been shown that the supported model semantics of normal logic programs can characterize point attractors of Boolean networks. We here newly define supported classes of normal...

Objectives . The problem of circuit implementation incompletely specified (partial) k-valued logic functions given by tabular representations is considered. stage technologically independent optimization studied to obtain minimized systems completely Boolean from partial logic. According these functions, technological mapping performed at the second synthesis circuits. Methods Using additional ...

This research study sought to evaluate aimed at evaluating the possible advantages of using Fuzzy Logic as opposed Boolean assess environmental contamination and source appraisal for polycyclic aromatic hydrocarbons (PAH). Results obtained through traditional assessment tools two different tropical coastal areas clustering principal components analysis were compared with those derived from Logi...