1948 search results - page 220 / 390 » Formalizing Mirror Theory |
176
click to vote
CACM
2010
15 years 4 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
222
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
224
click to vote
CL
2012
Springer
13 years 9 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
169
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
160
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...