3319 search results - page 121 / 664 » Subshifts, Languages and Logic |
77
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
ICGI
1994
Springer
15 years 4 months ago
1994
Springer
: This paper deals on defining object-oriented inferences by desining a new unification procedure called ?-unification (which leads to a sound and complete resolution) in DF-logic,...
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a compiler from expressive, relational specifications to logic programs. Specifically, the compiler translates the Imperative Alloy specification language to...
136
Voted
AIML
2000
15 years 2 months ago
2000
Notions of context for natural language interpretation are factored in terms of three processes: translation, entailment and attunement. The processes are linked by accessibility r...
189
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...