119 search results - page 1 / 24 » Tree-Width for First Order Formulae |
89
Voted
CSL
2009
Springer
15 years 2 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
97
Voted
KR
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
JSYML
2010
14 years 5 months ago
2010
We prove that given any first order formula in the language L = {+,
86
Voted
AAAI
1994
14 years 11 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...