119 search results - page 7 / 24 » Tree-Width for First Order Formulae |
117
Voted
FROCOS
2000
Springer
15 years 3 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
114
Voted
ICTAC
2009
Springer
14 years 10 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
AAAI
2008
15 years 2 months ago
2008
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
122
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
APAL
2004
15 years 3 days ago
2004
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...