Sciweavers

156 search results - page 24 / 32
» Propositional Logic for Circuit Classes
Sort
View
KR
2004
Springer
14 years 1 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
FPGA
2005
ACM
215views FPGA» more  FPGA 2005»
14 years 1 months ago
Design, layout and verification of an FPGA using automated tools
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...
Ian Kuon, Aaron Egier, Jonathan Rose
LICS
1994
IEEE
13 years 11 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
CADE
2007
Springer
14 years 8 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
RTA
2004
Springer
14 years 1 months ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt