Sciweavers

3831 search results - page 565 / 767
» Dynamic Context Logic
Sort
View
JAIR
2010
111views more  JAIR 2010»
15 years 2 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
LPAR
2010
Springer
15 years 2 months ago
On the Complexity of Model Expansion
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...
FORTE
2009
15 years 2 months ago
Keep It Small, Keep It Real: Efficient Run-Time Verification of Web Service Compositions
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
Luciano Baresi, Domenico Bianculli, Sam Guinea, Pa...
IFIP
2009
Springer
15 years 2 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
CVPR
2011
IEEE
15 years 21 days ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller