First-Order Logic Characterization of Program Properties.

@article{DBLP:journals/tkde/WangY94,
  author    = {Ke Wang and
               Li-Yan Yuan},
  title     = {First-Order Logic Characterization of Program Properties},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {4},
  year      = {1994},
  pages     = {518-533},
  ee        = {db/journals/tkde/WangY94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Krzysztof R. Apt, Marc Bezem: Acyclic Programs. ICLP 1990: 617-633 BibTeX

[2]

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148 BibTeX

[3]

Serge Abiteboul, Richard Hull: Data Functions, Datalog and Negation (Extended Abstract). SIGMOD Conference 1988: 143-153 BibTeX

[4]

Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 BibTeX

[5]

José A. Blakeley, Neil Coburn, Per-Åke Larson: Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates. VLDB 1986: 457-466 BibTeX

[6]

Alexander Brodsky, Yehoshua Sagiv: Inference of Monotonicity Constraints in Datalog Programs. PODS 1989: 190-199 BibTeX

[7]

Keith L. Clark: Negation as Failure. Logic and Data Bases 1977: 293-322 BibTeX

[8]

Lawrence Cavedon: Continuity, Consistency, and Completeness Properties for Logic Programs. ICLP 1989: 571-584 BibTeX

[9]

Ashok K. Chandra, David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15(1985) BibTeX

[10]

Upen S. Chakravarthy, John Grant, Jack Minker: Foundations of Semantic Query Optimization for Deductive Databases. Foundations of Deductive Databases and Logic Programming. 1988: 243-273 BibTeX

[11]

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 BibTeX

[12]

Hendrik Decker: Integrity Enforcement on Deductive Databases. Expert Database Conf. 1986: 381-395 BibTeX

[13]

Charles Elkan: Independence of Logic Database Queries and Updates. PODS 1990: 154-160 BibTeX

[14]

Ronald Fagin: Horn clauses and database dependencies. J. ACM 29(4): 952-985(1982) BibTeX

[15]

Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080 BibTeX

[16]

Hervé Gallaire, Jack Minker (Eds.): Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, 1977. Advances in Data Base Theory Plemum Press 1978, ISBN 0-306-40060-X
Contents BibTeX

[17]

Allen Van Gelder, Kenneth A. Ross, John S. Schlipf: The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650(1991) BibTeX

[18]

Irène Guessarian: Deciding Boundedness for Uniformly Connected Datalog Programs. ICDT 1990: 395-405 BibTeX

[19]

Paris C. Kanellakis, Serge Abiteboul: Database Theory Column: Deciding Bounded Recursion in Database Logic Programs. SIGACT News 20(4): 17-23(1989) BibTeX

[20]

Anthony C. Klug, Rod Price: Determining View Dependencies Using Tableaux. ACM Trans. Database Syst. 7(3): 361-380(1982) BibTeX

[21]

John W. Lloyd: Foundations of Logic Programming, 1st Edition. Springer 1984, ISBN 3-540-13299-6
BibTeX

[22]

John W. Lloyd, Liz Sonenberg, Rodney W. Topor: Integrity Constraint Checking in Stratified Databases. J. Log. Program. 4(4): 331-343(1987) BibTeX

[23]

John McCarthy: Circumscription - A Form of Non-Monotonic Reasoning. Artif. Intell. 13(1-2): 27-39(1980) BibTeX

[24]

Michael J. Maher: Equivalences of Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 627-658 BibTeX

[25]

...

[26]

Jean-Marie Nicolas: Logic for Improving Integrity Checking in Relational Data Bases. Acta Inf. 18: 227-253(1982) BibTeX

[27]

Jeffrey F. Naughton: Data Independent Recursion in Deductive Databases. J. Comput. Syst. Sci. 38(2): 259-289(1989) BibTeX

[28]

Jeffrey F. Naughton, Yehoshua Sagiv: A Decidable Class of Bounded Recursions. PODS 1987: 227-236 BibTeX

[29]

Teodor C. Przymusinski: On the Declarative Semantics of Deductive Databases and Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 193-216 BibTeX

[30]

John Alan Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41(1965) BibTeX

[31]

Kenneth A. Ross: Modular Acyclicity and Tail Recursion in Logic Programs. PODS 1991: 92-101 BibTeX

[32]

Yehoshua Sagiv: Optimizing Datalog Programs. Foundations of Deductive Databases and Logic Programming. 1988: 659-698 BibTeX

[33]

John C. Shepherdson: Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming. 1988: 19-88 BibTeX

[34]

Oded Shmueli: Decidability and Expressiveness of Logic Queries. PODS 1987: 237-249 BibTeX

[35]

Yehoshua Sagiv, Mihalis Yannakakis: Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655(1980) BibTeX

[36]

Rodney W. Topor, Liz Sonenberg: On Domain Independent Databases. Foundations of Deductive Databases and Logic Programming. 1988: 217-240 BibTeX

[37]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[38]

Moshe Y. Vardi: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries. PODS 1988: 341-351 BibTeX

Referenced by

1. Yangjun Chen: Speeding up the Counting Method by Computing Heritage Functions in Topological Order. ADBIS 1997: 108-116