Sciweavers

506 search results - page 9 / 102
» Constructor-based observational logic
Sort
View
98
Voted
DAC
2006
ACM
16 years 1 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
CORR
2011
Springer
126views Education» more  CORR 2011»
14 years 4 months ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
ACTA
1998
64views more  ACTA 1998»
15 years 5 days ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
110
Voted
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 7 months ago
On Paraconsistent Weakening of Intuitionistic Negation
In [1], systems of weakening of intuitionistic negation logic called Zn and CZn were developed in the spirit of da Costa’s approach(c.f. [2]) by preserving, differently from da C...
Zoran Majkic
74
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 12 days ago
Extensionality of Spatial Observations in Distributed Systems
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observati...
Luís Caires, Hugo Torres Vieira