Article

Free access

Extending logic programming

Authors:

Domenico Sacca,

Dirk VermeirAuthors Info & Claims

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

Pages 184 - 193

https://doi.org/10.1145/93597.98728

Published: 01 May 1990 Publication History

Abstract

An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates. A sort of “isa” hierarchy can be defined among the modules in order to allow for rule inheritance. Therefore, every module sees its own rules as local rules and the rules of the other modules to which it is connected by the “isa” hierarchy as global rules. In this way, as local rules may hide global rules, it is possible to deal with default properties and exceptions. This new approach represents a novel attempt to combine the logic paradigm with the object-oriented one in knowledge base systems. Moreover, this approach provides a new ground for explaining some recent proposals of semantics for classical logic programs with negation in the rule bodies and gives an interesting semantics to logic programs with negated rule heads.

References

[1]

Apt, K, Batr, H, and Walker, A, "Towards a Theory of Declarattve Knowledge," Mmker, J (ed), Morgan Kaufman, Los Altos, 1987, pp 89-148

Digital Library

[2]

Ablteboul, S, Kanellakls, P C, "Object Idenlaty as a Query Language Pnmmve", ACM SIGMOD Con}" on the Management of Data, SIGMOD Record, Vol 18, No 2, June 1989, pp 159-173

Digital Library

[3]

Chandra, A, Hard, D, "Horn Clauses and Generahzatlon", Journal of Logtc Progranmung 2, 1, 1985, pp 320-340

[4]

Clark, K L, "Negation as Fadure", m Logic and Data Base, (Gallalre and Mmker, eds), Plenum Press, New York, 1978, pp 293-322

[5]

Fltung, M, Ben-Jacob, M, "Stratafied and Threevalued Logic Programming Semantacs", Proc 5th ira Conf and Symp on Logtc Progranmung, MIT Press, Cambndge, Ma, 1988, pp 1054-1068

[6]

Gelfond, M, Llfsch~tz, V, 'Tne Stable Model Semanucs for Logic Programming", Proc 5th Int Conf and Symp on Logic Progranmung, MIT Press, Cambridge, Ma, 1988, pp 1070-1080

[7]

Gelfond, M, Llfschltz, V, "Logic Programs with Clasmcal Negalaon", unpubhshed manuscript, September 1989

[8]

KIWIs Team, "The speclfieauons of BQM", ESPR1T Techmcal Report, February 1990

[9]

Kffer, M, Lausen, G, "F-Logic A Higher-Order Language for Reasomng about Objects, Inheritance and Scheme" ACM SIGMOD Conf on the Management of Data, SIGMOD Record, Vol 18, No 2, June 1989, pp 134-146

Digital Library

[10]

Kowalska, R A, Sadn, F, "Loglc Programs with Exceptmns", unpubhshed manuscnpt, November 1989

[11]

Lloyd, J W, Foundattons of Logic Programnung, Springer Verlag, Berlin, 1987

Digital Library

[12]

Laenens, E, Vermelr, D, "A Flxpomt Semanucs for Ordered Logic", Journal of Logic and Computataon, to appear

[13]

Naqvl, S A, "A Logic for Negauon m Database Systems," m Foundattons of Deducttve Databases and Logtc Progranunmg, (Mmker, J ed ), Morgan Kaufman, Los Altos, 1987

[14]

Przymusmskl, T C, "On the Semanucs of Straufied Deducuve Databases and Logic Programs", Journal of Automated Reasomng, to appear

[15]

Przymusmskl, T C, "On the Declaralave and Procedural Semantics of Deducuve Databases and Logic Programs", m Foundattons of Deductive Databases and Logtc Programming, (Mmker, J ed ), Morgan Kaufman, Los Altos, 1987, pp 193-216

Digital Library

[16]

Przymusmskl, T C, "Well-founded models are mtersecuons of three-valued stable models", unpubhshed manuscript, 1989

[17]

Relter, R, "On Closed World Databases", m Logtc and Data Base, (Gallatre and Mmker, eds), Plenum Press, New York, 1978, pp 55-76

[18]

Sacc~, D, Zamolo, C, "Stable models and Nondeterminism for logic programs wlth negation", to appear m Proc ACM Symp on Principles of Database Systems, 1990

Digital Library

[19]

Tarskl, A "A Lattace Theoretacal Flxpomt Theorem and its Apphcatlon," Pacific Journal of Mathematics 5, 1955, pp 285-309

[20]

Ullman, J D, Principles of Database and Knowledge-Base Systems, Vol 1 and 2, Computer Science Press, Rockwlle, Md, 1988

Digital Library

[21]

Van Gelder, A, "Negation as Fatlure Using Tight Derivations for Logic Programs," Proc 3rd IEEE Syrup on Logic Programming, Sprmger-Verlag, 1986, pp 127-138

[22]

Van Gelder, A, Ross, K, Schllpf, J S, "Unfounded Sets and Well-Founded Semanucs for General Logic Programs", ACM SIGMOD.SIGACT Symp on Prmczples of Database Syste.nts, March 1988, pp 221- 230

Digital Library

Cited By

Calimeri FIanni G(2006)Template programs for Disjunctive Logic Programming: An operational semanticsAI Communications10.5555/1219115.121911919:3(193-206)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.5555/1219115.1219119
Bertino EBuccafurri FFerrari ERullo P(2006)An authorization model and its formal semanticsComputer Security — ESORICS 9810.1007/BFb0055860(127-142)Online publication date: 28-May-2006
https://doi.org/10.1007/BFb0055860
Buccafurri FLeone NPalopoli LRullo P(2006)Disjunctive ordered logicDatabase and Expert Systems Applications10.1007/BFb0049128(303-312)Online publication date: 1-Feb-2006
https://doi.org/10.1007/BFb0049128
Show More Cited By

Index Terms

Extending logic programming

Recommendations

Extending logic programming

An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a ...
Extending logic programming with coinduction
Extending paraconsistent quantum logic: a single‐antecedent/succedent system approach
Abstract
In this study, some conservative extensions of paraconsistent quantum logic, such as Nelsonian, modal, infinitary and temporal, are investigated by extending a single‐antecedent/succedent sequent calculus PQL for paraconsistent quantum logic. A ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

May 1990

398 pages

ISBN:0897913655

DOI:10.1145/93597

Chairman:
Hector Garcia-Molina
Princeton Univ., Princeton, NJ

ACM SIGMOD Record Volume 19, Issue 2
Jun. 1990
392 pages
ISSN:0163-5808
DOI:10.1145/93605
Editor:
H. V. Jagadish
AT&T Bell Laboratories, Murray Hill, NJ
Issue’s Table of Contents

Copyright © 1990 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD 90

Sponsor:

SIGMOD

SIGMOD 90: SIGMOD'90

May 23 - 26, 1990

New Jersey, Atlantic City, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
413
Total Downloads

Downloads (Last 12 months)83
Downloads (Last 6 weeks)29

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Calimeri FIanni G(2006)Template programs for Disjunctive Logic Programming: An operational semanticsAI Communications10.5555/1219115.121911919:3(193-206)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.5555/1219115.1219119
Bertino EBuccafurri FFerrari ERullo P(2006)An authorization model and its formal semanticsComputer Security — ESORICS 9810.1007/BFb0055860(127-142)Online publication date: 28-May-2006
https://doi.org/10.1007/BFb0055860
Buccafurri FLeone NPalopoli LRullo P(2006)Disjunctive ordered logicDatabase and Expert Systems Applications10.1007/BFb0049128(303-312)Online publication date: 1-Feb-2006
https://doi.org/10.1007/BFb0049128
Leone NMecchia ARossi GRullo P(2005)The basic query machine of the KIWIS systemActive Flow and Combustion Control 201810.1007/BFb0035157(632-650)Online publication date: 21-Jun-2005
https://doi.org/10.1007/BFb0035157
Laenens EVermeir D(2005)A logical basis for object oriented programmingLogics in AI10.1007/BFb0018450(317-332)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0018450
Benkerimi KHill P(2005)Object-oriented programming in Gödel: An experimentMeta-Programming in Logic10.1007/3-540-56282-6_12(177-191)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-56282-6_12
Laenens EVermeir DZaniolo C(2005)Logic programming semantics made easyAutomata, Languages and Programming10.1007/3-540-55719-9_99(499-508)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-55719-9_99
Ceri SCacace FTanca L(2005)Object orientation and logic programming for databases: A season's flirt or long-term marriage?Next Generation Information System Technology10.1007/3-540-54141-1_8(124-143)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54141-1_8
Ahlsen MD'Atri AJohannesson PLaenens ELeone NRullo PRossi PStaes FTarantino LVan Beirendonck Lvan Cadsand FVan Santvliet WVanslembrouck JVerdonk BVermeir D(2005)The KIWIS knowledge base management systemActive Flow and Combustion Control 201810.1007/3-540-54059-8_81(79-97)Online publication date: 29-Jul-2005
https://doi.org/10.1007/3-540-54059-8_81
Laenens EVermeir D(2005)On the relationship between well-founded and stable partial modelsMFDBS 9110.1007/3-540-54009-1_5(59-73)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-54009-1_5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten