TY - JOUR
AU - THOMAS EITER, GEORG GOTTLOB, NICOLA LEONE
AB - According to Leibniz' principle, two individuals a and b are indiscernible, if they share the same properties. Indiscernibility of objects provides a potential for optimization in deductive systems, and has, for example, been exploited in the area of active database systems. In this paper, we address the issue of indiscernibility in logic programs and outline possible benefits for computation. After a formal definition of the notion of indiscernibility, we investigate some basic properties. The main contribution is then an analysis of the computational cost of checking indiscernibility of individuals (i.e. constants) in logic programs without function symbols, which we pursue in detail for ground logic programs. For the concern of query optimization, they show that online computation of indiscernibility is expensive, and thus suggest adopting an offline strategy, which may pay off for certain computational tasks. © Oxford University Press « Previous | Next Article » Table of Contents This Article J Logic Computation (1997) 7 (6): 805-824. doi: 10.1093/logcom/7.6.805 » Abstract Free Full Text (PDF) Free Classifications Original Article Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Citing articles via Google Scholar Google Scholar Articles by EITER, T. Articles by LEONE, N. Search for related content Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue October 2015 25 (5) Alert me to new issues The Journal About this journal Publishers' Books for Review Rights & Permissions Dispatch date of the next issue We are mobile – find out more Journals Career Network Impact factor: 0.512 5-Yr impact factor: 0.671 Editor-in-Chief D M Gabbay View full editorial board Journal of Logic and Computation is published under licence from Professor Dov Gabbay as owner of the journal. For Authors Instructions to authors Self archiving policy Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01640", "SCI01760"); Most Most Read The logic and philosophy of information corner: Presentation and call for papers The abstract state machines method for modular design and analysis of programming languages Persuasion in Practical Argument Using Value-based Argumentation Frameworks Differential-algebraic Dynamic Logic for Differential-algebraic Programs A Structural Proof of the Soundness of Rely/guarantee Rules » View all Most Read articles Most Cited Admissible Rules of Modal Logics Persuasion in Practical Argument Using Value-based Argumentation Frameworks A Modal Logic for Coalitional Power in Games Unification through Projectivity Fibring of logics as a categorial construction » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1465-363X - Print ISSN 0955-792X Copyright © 2015 Dov Gabbay Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
TI - On the Indiscernibility of Individuals in Logic Programming
JF - Journal of Logic and Computation
DO - 10.1093/logcom/7.6.805
DA - 1997-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/on-the-indiscernibility-of-individuals-in-logic-programming-aW5n6zLzlR
SP - 805
VL - 7
IS - 6
DP - DeepDyve
ER -