Finding Finite Herbrand Models

Abstract

Abstract. We show that finding finite Herbrand models for a restricted class of first-order clauses is ExpTime-complete. A Herbrand model is called finite if it interprets all predicates by finite subsets of the Herbrand universe. The restricted class of clauses consists of anti-Horn clauses with monadic predicates and terms constructed over unary function symbols and constants. The decision procedure can be used as a new goal-oriented algorithm to solve linear language equations and unification problems in the description logic FL0. The new algorithm has only worst-case exponential runtime, in contrast to the previous one which was even best-case exponential.

Bipolar disorder in children and adolescents: from the beginning to the consequences

“…In the neurological context, white matter abnormalities detected by Diffusion Tensor Magnetic Resonance Imaging (DT-MRI) have been consistently reported both in BD patients [5, 78,79] and in their non-BD relatives in adulthood [5, [80][81][82]. Children and adolescents with BD also have been found to display decreased fractional anisotropy (FA), a measure of fibers coherence and organization, but findings differ across studies [5, [83][84][85].…”

Experiments on Infinite Model Finding in SMT Solving

“…A large body of research exists on finite model finding with numerous techniques anchored in SAT [21,30,38], constraint programming [9,32,48,49], SMT [41,42], and dedicated procedures [17]. The calculated models find a bevy of applications in automated reasoning and computational algebra as counterexamples to incorrect conjectures [14] or for mathematicians interested in particular mathematical structures [23].…”