60 search results - page 10 / 12 » Loop Formulas for Circumscription |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This research concerns fundamental performance limitations in control of discrete time nonlinear systems. The fundamental limitations are expressed in terms of the average cost of ...
AFRICACRYPT
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
ELPUB
2008
ACM
13 years 9 months ago
2008
ACM
This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into ac...
JAR
2006
13 years 7 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...