58 search results - page 3 / 12 » Ordered Completion for First-Order Logic Programs on Finite ... |
KBSE
1999
IEEE
13 years 9 months ago
1999
IEEE
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
CIE
2009
Springer
14 years 1 days ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
AAAI
1996
13 years 6 months ago
1996
Conditional logics play an important role in recent attempts to investigate default reasoning. This paper investigates firstorder conditional logic. We show that, as for first-ord...
LICS
2009
IEEE
14 years 3 days ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...