Name
Abstract | ||
|---|---|---|
First Order ID-Logic interprets general first order, non- monotone, inductive definability by generalizing the well- founded semantics for logic programs. We show that, for general (thus perhaps infinite) structures, inference in First Order ID-Logic is complete 1 2 over the natural numbers. We also prove a Skolem Theorem for the logic: every consistent formula of First Order ID-Logic has a countable model. |
Year | Venue | Keywords |
|---|---|---|
2008 | ISAIM | first order |
Field | DocType | Citations |
Discrete mathematics,Knowledge representation and reasoning,Natural number,Countable set,First order,Inference,Generalization,Semantics,Mathematics | Conference | 0 |
PageRank | References | Authors |
0.34 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John S. Schlipf | 1 | 1697 | 247.21 |
| Marc Denecker | 2 | 1626 | 106.40 |