As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...