Article

Free access

Inference of inequality constraints in logic programs (extended abstracts)

Authors:

Alexander Brodsky,

Yehoshua SagivAuthors Info & Claims

PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 227 - 240

https://doi.org/10.1145/113413.113434

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

Afrati, F., Papadimitriou, C.H., Papageorgiou, G., Roussou, A., Sagiv, Y., Ullman, J.D.: On the convergence of query evaluation. Y. of Computer and System Sciences, Vol. 38, No. 2 (April 1989), pp. 341-359.

Crossref

Google Scholar

[2]

Apt, K.R., Pedreschi, D.: Studies in pure Prolog" termination. Report CS-R9048, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, Sept. 1990.

Google Scholar

[3]

Brodsky, A., Sagiv, Y.: Inference of monotonicity constraints in datalog programs. Proc. A CM SIGA CT- SIGART-SIGMOD Syrup. on Principles of Database Systems, Philadelphia, 1989, pp. 190-199.

Digital Library

Google Scholar

[4]

Brodsky, A., Sagiv, Y." On termination of datalog programs. Proc. 1st International Conference on Deductive and Object-Oriented Databases, Kyoto, japan, 1989, pp. 95-112.

Google Scholar

[5]

Kifer,M.,Lozinski, E.L.: SYGRAF--Implememing logic programs in a database style. IEEE Trans. on Software Eng., July 1988, pp. 922-935.

Digital Library

Google Scholar

[6]

Kifer, M., Ramakrislman, R., Silberschatz, A.: An axiomatic approach to deciding query safety in deductive databases. Proc. 7th A CM Syrup. on Principles of Database Systems, Austin, 1988, pp. 52-60.

Digital Library

Google Scholar

[7]

Krishnamurthy, R., Ramakrishnan, R., Shrnueli, 0.: A framework for testing safety and effective computability of extended datalog. Proc. A CM Syrup. on Management of Data, Chicago, 1988, pp. 154-163.

Digital Library

Google Scholar

[8]

Morris, K., Ullman, J.D., Van Gelder, A.: Design overview of the NAIL! system. Proc. Third Int. Conf. on Logic Programming, 1986, pp. 554-568.

Digital Library

Google Scholar

[9]

Morris, K., Naughton, J.F., Saraiya, Y., Ullman, J.D., Van Gelder, A.: YAWN! (yet another window on NAIL!). Data Engineering, (C. Zaniolo, ed.), 10:4(1987), pp. 28-43.

Google Scholar

[10]

Naqvi, S., Tsur, S.: A Logical Language for Data and Knowledge Bases. Computer Science Press, Rockville, Md., 1988.

Digital Library

Google Scholar

[11]

Pratt, V.: Two easy theories whose combination is hard. Unpublished memorandum, M.I.T., Cambridge, Mass., 1977.

Google Scholar

[12]

Pliimer, L.: Termination proofs for logic programs based on predicate inequalities. Proc. 7th International Conference on Logic Programming, Jerusalem, 1990, pp. 634-648.

Digital Library

Google Scholar

[13]

Pliimer, L.: Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence 446, Springer- Verlag, Berlin, 1990.

Digital Library

Google Scholar

[14]

Ramakristman, It., Bancilhon, F., Silberschatz, A.: Safety of recursive Horn clauses with infinite relations. Proc. 6th A CM Syrup. on Principles of Database Systems, San Diego, 1987, pp. 328-339.

Digital Library

Google Scholar

[15]

Rosenkratz, D.J., Hunt, H.B.: Processing conjunctive predicates and queries. Proc. 6th International Conference on Very Large Data Bases, F. Lochovsky and R. Taylor, Eds. IEEE, New York, 1980.

Google Scholar

[16]

Sagiv, Y., Vardi, M.Y." Safety of datalog queries over infinite databases. Proc. A CM SIGA CT- SIGART-SIGMOD Syrup. on Principles of Database Systems, Philadelphia, 1989, pp. 160-171.

Digital Library

Google Scholar

[17]

Shmueli, 0.: Decidability and expressiveness aspects of logic queries. Proc. 6th A CM Syrup. on Principles of Database Systems, San Diego, pp. 237-249.

Digital Library

Google Scholar

[18]

Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes. Proc. l Oth A CM SIGA CT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1991. (This proceedings).

Digital Library

Google Scholar

[19]

Ullman, :I.D., Van Gelder, A.: Efficient tests for top-down termination of logical rules. JAGM 35:2(1988), pp. 345-373.

Digital Library

Google Scholar

[20]

Van Gelder, A.: Deriving constraints among argument sizes in logic programs. Proc. 9th A CM SIGA CT- SIGMOD-SIGART Syrup. on Principles of Database Systems, Nashville, 1990, pp. 47-60.

Digital Library

Google Scholar

[21]

Zaniolo, C." Design and implementation of a logic based language for data intensive applications. Proc. Fifth intl. Syrup. on Logic Programming, 1988, pp. 1666-1687.

Google Scholar

Cited By

View all

Ben-Amram A(2010)Size-Change Termination, Monotonicity Constraints and Ranking FunctionsLogical Methods in Computer Science10.2168/LMCS-6(3:2)2010Volume 6, Issue 3Online publication date: 11-Jul-2010
https://doi.org/10.2168/LMCS-6(3:2)2010
Ben-Amram A(2009)Size-Change Termination, Monotonicity Constraints and Ranking FunctionsProceedings of the 21st International Conference on Computer Aided Verification10.1007/978-3-642-02658-4_12(109-123)Online publication date: 23-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02658-4_12
Ben-Amram A(2008)Size-change termination with difference constraintsACM Transactions on Programming Languages and Systems10.1145/1353445.135345030:3(1-31)Online publication date: 21-May-2008
https://dl.acm.org/doi/10.1145/1353445.1353450
Show More Cited By

Index Terms

Inference of inequality constraints in logic programs (extended abstracts)
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
2. Theory of computation

Recommendations

Inference of monotonicity constraints in datalog programs
PODS '89: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Datalog (i.e., function-free logic) programs with monotonicity constraints on extensional predicates are considered. A monotonicity constraint states that one argument of a predicate is always less than another argument, according to some partial order. ...
Inference of monotonicity constraints in Datalog programs

Datalog (i.e., functionýfree logic) programs with monotonicity constraints on extensional predicates are considered. A monotonicity constraint states that one argument of a predicate or a constant is always less than another argument or a constant, ...
Lagrange neural network for solving CSP which includes linear inequality constraints
ICANN'05: Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II

We proposed a neural network called LPPH-CSP (Lagrange Programming neural network with Polarized High-order connections for Constraint Satisfaction Problem) to solve the CSP. The CSP is a problem to find a variable assignment which satisfies all given ...

Comments

Information & Contributors

Information

Published In

PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

April 1991

341 pages

ISBN:0897914309

DOI:10.1145/113413

Chairman:
Daniel J. Rosenkrantz
State Univ. of New York, Albany

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS91

Sponsor:

SIGMOD/PODS91: SIGMOD/PODS 91

May 29 - 31, 1991

Colorado, Denver, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
341
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)11

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ben-Amram A(2010)Size-Change Termination, Monotonicity Constraints and Ranking FunctionsLogical Methods in Computer Science10.2168/LMCS-6(3:2)2010Volume 6, Issue 3Online publication date: 11-Jul-2010
https://doi.org/10.2168/LMCS-6(3:2)2010
Ben-Amram A(2009)Size-Change Termination, Monotonicity Constraints and Ranking FunctionsProceedings of the 21st International Conference on Computer Aided Verification10.1007/978-3-642-02658-4_12(109-123)Online publication date: 23-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02658-4_12
Ben-Amram A(2008)Size-change termination with difference constraintsACM Transactions on Programming Languages and Systems10.1145/1353445.135345030:3(1-31)Online publication date: 21-May-2008
https://dl.acm.org/doi/10.1145/1353445.1353450
Albert EArenas PCodish MGenaim SPuebla GZanardini D(2008)Termination Analysis of Java BytecodeProceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems10.1007/978-3-540-68863-1_2(2-18)Online publication date: 4-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-68863-1_2
Revesz P(2005)Constraint databases: A surveySemantics in Databases10.1007/BFb0035010(209-246)Online publication date: 23-Jun-2005
https://doi.org/10.1007/BFb0035010
Speirs CSomogyi ZSøndergaard H(2005)Termination analysis for MercuryStatic Analysis10.1007/BFb0032740(157-171)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0032740
Fribourg LPeixoto M(2005)Bottom-up evaluation of Datalog programs with arithmetic constraintsAutomated Deduction — CADE-1210.1007/3-540-58156-1_22(311-325)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-58156-1_22
Kanellakis PGoldin D(2005)Constraint programming and database query languagesTheoretical Aspects of Computer Software10.1007/3-540-57887-0_92(96-120)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57887-0_92
Lakshmanan LNonen D(2005)Superfiniteness of query answers in deductive databases: An automata-theoretic approachFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-56287-7_104(176-190)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-56287-7_104
Sagiv Y(2005)On testing effective computability of magic programsDeductive and Object-Oriented Databases10.1007/3-540-55015-1_13(244-262)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-55015-1_13
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Inference of monotonicity constraints in datalog programs

Inference of monotonicity constraints in Datalog programs

Lagrange neural network for solving CSP which includes linear inequality constraints

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Inference of monotonicity constraints in datalog programs

Inference of monotonicity constraints in Datalog programs

Lagrange neural network for solving CSP which includes linear inequality constraints

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations