@Article{Gan-Nav-Sch-Son-Stu_TPLP13,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter Schachte and
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Failure Tabled Constraint Logic Programming by Interpolation},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {13},
  number    = {4--5},
  pages     = {593--607},
  year      = {2013},
  doi       = {10.1017/S1471068413000379},
  abstract  = {We present a new execution strategy for constraint logic
		programs called \emph{Failure Tabled CLP}. Similarly to
		\emph{Tabled CLP} our strategy records certain derivations
		in order to prune further derivations. However, our method
		only learns from \emph{failed derivations}. This allows us
		to compute \emph{interpolants} rather than 
		\emph{constraint projection} for generation of 
		\emph{reuse conditions}. As a result, our technique can
		be used where projection is too expensive or does not 
		exist. Our experiments indicate that Failure Tabling can
		speed up the execution of programs with many redundant 
		failed derivations as well as achieve termination in the
		presence of infinite executions.},
  keywords  = {Logic programming, Interpolants},
}

{"_id":"GCT9TCumJXgSuCE6j","bibbaseid":"gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013","author_short":["Gange, G.","Navas, J. A.","Schachte, P.","Søndergaard, H.","Stuckey, P. J."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Graeme"],"propositions":[],"lastnames":["Gange"],"suffixes":[]},{"firstnames":["Jorge","A."],"propositions":[],"lastnames":["Navas"],"suffixes":[]},{"firstnames":["Peter"],"propositions":[],"lastnames":["Schachte"],"suffixes":[]},{"firstnames":["Harald"],"propositions":[],"lastnames":["Søndergaard"],"suffixes":[]},{"firstnames":["Peter","J."],"propositions":[],"lastnames":["Stuckey"],"suffixes":[]}],"title":"Failure Tabled Constraint Logic Programming by Interpolation","journal":"Theory and Practice of Logic Programming","volume":"13","number":"4–5","pages":"593–607","year":"2013","doi":"10.1017/S1471068413000379","abstract":"We present a new execution strategy for constraint logic programs called \\emphFailure Tabled CLP. Similarly to \\emphTabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from \\emphfailed derivations. This allows us to compute \\emphinterpolants rather than \\emphconstraint projection for generation of \\emphreuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.","keywords":"Logic programming, Interpolants","bibtex":"@Article{Gan-Nav-Sch-Son-Stu_TPLP13,\n author = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n title = {Failure Tabled Constraint Logic Programming by Interpolation},\n journal = {Theory and Practice of Logic Programming},\n volume = {13},\n number = {4--5},\n pages = {593--607},\n year = {2013},\n doi = {10.1017/S1471068413000379},\n abstract = {We present a new execution strategy for constraint logic\n\t\tprograms called \\emph{Failure Tabled CLP}. Similarly to\n\t\t\\emph{Tabled CLP} our strategy records certain derivations\n\t\tin order to prune further derivations. However, our method\n\t\tonly learns from \\emph{failed derivations}. This allows us\n\t\tto compute \\emph{interpolants} rather than \n\t\t\\emph{constraint projection} for generation of \n\t\t\\emph{reuse conditions}. As a result, our technique can\n\t\tbe used where projection is too expensive or does not \n\t\texist. Our experiments indicate that Failure Tabling can\n\t\tspeed up the execution of programs with many redundant \n\t\tfailed derivations as well as achieve termination in the\n\t\tpresence of infinite executions.},\n keywords = {Logic programming, Interpolants},\n}\n\n","author_short":["Gange, G.","Navas, J. A.","Schachte, P.","Søndergaard, H.","Stuckey, P. J."],"key":"Gan-Nav-Sch-Son-Stu_TPLP13","id":"Gan-Nav-Sch-Son-Stu_TPLP13","bibbaseid":"gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013","role":"author","urls":{},"keyword":["Logic programming","Interpolants"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"people.eng.unimelb.edu.au/harald/bibbase.bib","dataSources":["yWvm3kzg5vKQAPLm7","ofmsZryxNDBSpE7j5","9aC4cxLD8D6oJ3FLN","wpkuJrZJJtqra3FbL","XqcrNTrCCBr9mSd37"],"keywords":["logic programming","interpolants"],"search_terms":["failure","tabled","constraint","logic","programming","interpolation","gange","navas","schachte","søndergaard","stuckey"],"title":"Failure Tabled Constraint Logic Programming by Interpolation","year":2013}