Datalog vs first-order logic
نویسندگان
چکیده
منابع مشابه
Datalog vs. First-Order Logic
Our main result is that every datalog query expressible in rst-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for nite structures. In addition, we give some counter-examples delimiting the main result.
متن کاملFirst-Order Disjunctive Logic Programming vs Normal Logic Programming
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-order DLP is strictly more expressive than NLP. This result still holds even if auxiliary predicates are allowed, assuming NP 6= coNP. On the other side, we propose a partial transla...
متن کاملTowards E cient Higher-order Logic Learning in a First-order Datalog Framework
Within ILP, the concepts to be learned are normally considered as being succinctly representable in rst-order logic. In a previous paper the authors demonstrated that increased predictive accuracy can be achieved by employing higher-order logic (HOL) in the background knowledge. In this paper, the exible higher-order Horn clauses (FHOHC) framework is introduced. It is more expressive than the f...
متن کاملLogic Programs vs. First-Order Formulas in Textual Inference
In the problem of recognizing textual entailment, the goal is to decide, given a text and a hypothesis expressed in a natural language, whether a human reasoner would call the hypothesis a consequence of the text. One approach to this problem is to use a first-order reasoning tool to check whether the hypothesis can be derived from the text conjoined with relevant background knowledge, after ex...
متن کاملSome Remarks on the Definability of Transitive Closure in First-order Logic and Datalog
In the last WSML phone conference we had a brief discussion about the expressivity of First-order Logic and Datalog resp. the relation between the expressiveness of those two languages. In particular, there has been some confusion around the description of the transitive closure R of some binary relation R. In this short document, we want to clarify the situation and hope to remedy the confusion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80071-6