26,123 Hits in 3.3 sec

Speculative Computations in Or-Parallel Tabled Logic Programs [chapter]

Ricardo Rocha, Fernando Silva, Vítor Santos Costa
2004 Lecture Notes in Computer Science  
For parallel systems, the presence of pruning operators introduces the problem of speculative computations.  ...  Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary computations.  ...  At the end, the set of answers stored in the root node are the set of valid answers for the given query goal.  ... 
doi:10.1007/978-3-540-27775-0_18 fatcat:7r3mkox2yrh2bi6knzv5ak4a3m

Just enough tabling

Konstantinos Sagonas, Peter J. Stuckey
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
In particular, JET allows pruning of tabled logic programs to be performed without resorting to any recomputation.  ...  Properties of just enough tabling and possible uses of the JET mechanism in a tabling system are also briefly discussed.  ...  Given a forest F for a goal G0, another operation comes to play: (COMPLETION) Let C be a set of calls in F for which all preceding operations have been exhaustively performed.  ... 
doi:10.1145/1013963.1013975 dblp:conf/ppdp/SagonasS04 fatcat:6kywfa6alzbg7eg2km3b2tz56q

Retroactive Subsumption-Based Tabled Evaluation of Logic Programs [chapter]

Flávio Cruz, Ricardo Rocha
2010 Lecture Notes in Computer Science  
Our experiments using the YapTab tabling engine show considerable gains in evaluation time for some applications, at the expense of a very small overhead for the programs that cannot benefit from it.  ...  Tabling based systems use call similarity to determine if a tabled subgoal will produce their own answers or if it will consume from another subgoal.  ...  Otherwise, a new answer set A C = A C ∪ a is generated. Answer Resolution: this operation checks whether a consumer node C has new answers available for consumption.  ... 
doi:10.1007/978-3-642-15675-5_13 fatcat:paebhxy67rakhj2h2ppujtph24

Supporting Pruning in Tabled LP [chapter]

Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo
2013 Lecture Notes in Computer Science  
This paper analyzes issues which appear when supporting pruning operations in tabled LP.  ...  The use of once/1 with answer-on-demand strategies makes it possible to avoid computing unneeded solutions for problems which can benefit from tabled LP but in which only a single solution is needed, such  ...  This dependency on the program history is also an open issue in existing tabled LP systems supporting pruning operations.  ... 
doi:10.1007/978-3-642-45284-0_5 fatcat:5eyxyhs5fzalpacangmrmxqeom

Approximate Pruning in Tabled Logic Programming [chapter]

Luís F. Castro, David S. Warren
2003 Lecture Notes in Computer Science  
Current Tabled Prolog systems improve Prolog's evaluation strategy in several ways, but lack satisfactory support for pruning operations.  ...  In particular, we concentrate on systems based on SLG resolution. A once operator is described, which approximates demand-based pruning, providing for an efficient implementation in the XSB system.  ...  We have benchmarked a set of non-pruning benchmarks on XSB with and without support for our pruning operator. The maximum overhead observed was about 3%.  ... 
doi:10.1007/3-540-36575-3_6 fatcat:7p64epoab5dr5k6knkvplwezpy

On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation [chapter]

Ricardo Rocha
2006 Lecture Notes in Computer Science  
To validate our proposals, we have implemented them in the YapTab tabling system as an elegant extension of the original design.  ...  The discussion we address in this paper was also motivated by practical deficiencies we encountered, in particular, on the table storage mechanisms used for tabling support.  ...  Acknowledgments We are very thankful to Nuno Fonseca for his support with the April ILP System.  ... 
doi:10.1007/978-3-540-69611-7_10 fatcat:s7gixezhvner5ciriccegvuefa

Constructive negation by pruning

François Fages
1997 The Journal of Logic Programming  
The main result of the paper is the definition of a fixpoint semantics for normal CLP programs which is fully abstract for the observation of computed answer constraints.  ...  E> We show that a simple concurrent pruning mechanism over standard SLD derivation trees, called constructive negation by pruning, provides a complete operational semantics for normal constraint logic  ...  Therefore, we can define the operational semantics of the program as the set of computed answer constraints for unconstrained literals solely.  ... 
doi:10.1016/s0743-1066(96)00092-1 fatcat:4pgapcv7gbah3hu7jnhepstzwu

A Logic Programming Approach to Aspect Extraction in Opinion Mining

Qian Liu, Zhiqiang Gao, Bing Liu, Yuanlin Zhang
2013 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)  
In this paper, we show that Logic Programming, particularly Answer Set Programming (ASP), can be used to elegantly and efficiently implement the key components of syntax based aspect extraction.  ...  The concept of general words and their pruning are concisely captured by 10 new ASP rules, and a natural extension of the 8 rules for the original DP method.  ...  Note that the reduct of a program contains no negation as failure operators. A set S of ground literals is an answer set of a ground ASP program Π if S is the answer set of Π S .  ... 
doi:10.1109/wi-iat.2013.40 dblp:conf/webi/LiuGLZ13 fatcat:3b2fypb6tbf63d6vzi5pxsk24e

An Ordered Logic Program Solver [chapter]

Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
2005 Lecture Notes in Computer Science  
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs.  ...  The basic algorithm we propose computes the extended answer sets of a simple program using an intuitive 9-valued lattice, called T9.  ...  The OLPS system has been released under the GPL and is available for download from Preferred Answer Sets for Ordered Programs Preliminaries and Notation.  ... 
doi:10.1007/978-3-540-30557-6_11 fatcat:4bvzusubvvcajczsnfld3gv3gy

It was the training data pruning too! [article]

Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere
2018 arXiv   pre-print
We study the current best model (KDG) for question answering on tabular data evaluated over the WikiTableQuestions dataset.  ...  Disabling the pruning step drops the accuracy of the model from 43.3% to 36.3%.  ...  Acknowledgments We would like to thank Panupong Pasupat for helpful discussions on the pruning algorithm, and for providing us with the unpruned logical form candidates.  ... 
arXiv:1803.04579v1 fatcat:ovsan3qhafdx5nkck6qqdyiequ

A General Implementation Framework for Tabled CLP [chapter]

Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo, Peter Stuckey
2012 Lecture Notes in Computer Science  
Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches.  ...  This paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP).  ...  TCLP Program Transformation The program transformation for TCLP programs uses some operations provided by the tabling engine (lookup call/2, prune generators/1, is generator/1, consume answer/2, lookup  ... 
doi:10.1007/978-3-642-29822-6_11 fatcat:qfaiub2hiffcrpeu4wnffoltdy

Improving scalability of inductive logic programming via pruning and best-effort optimisation

Mishal Kazmi, Peter Schüller, Yücel Saygın
2017 Expert systems with applications  
We focus on extending the XHAIL algorithm for ILP which is based on Answer Set Programming and we evaluate our extensions using the Natural Language Processing application of sentence chunking.  ...  Inductive Logic Programming (ILP) combines rule-based and statistical artificial intelligence methods, by learning a hypothesis comprising a set of rules given background knowledge and constraints for  ...  We are grateful to Carmine Dodaro for providing us with support regarding the WASP solver.  ... 
doi:10.1016/j.eswa.2017.06.013 fatcat:mi7unvggkrhezklwzf6nsnerhm

Single Time-Stamped Tries for Retroactive Call Subsumption [article]

Flavio Cruz, Ricardo Rocha
2011 arXiv   pre-print
Tabling is an evaluation strategy for Prolog programs that works by storing answers in a table space and then by using them in similar subgoals.  ...  For this extension, we propose a new table space design, the Single Time Stamped Trie (STST), that is organized to make answer sharing across subsumed/subsuming subgoals simple and efficient.  ...  For both variant-based and subsumption-based tabling, we can synthesize the tabling instruction set into four main operations: Tabled Subgoal Call: this operation inspects the table space looking for a  ... 
arXiv:1112.3779v1 fatcat:wxgkh5vayjhfjedkwknpcgsm5e


Ahmed Eldawy, Yuan Li, Mohamed F. Mokbel, Ravi Janardan
2013 Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'13  
For each computational geometry operation, CG_Hadoop has two versions, one for the Apache Hadoop system and one for the SpatialHadoop system; a Hadoop-based system that is more suited for spatial operations  ...  , and closest pair, which present a set of key components for other geometric algorithms.  ...  For each operation, CG_Hadoop has two versions; one for the Apache Hadoop system and one for the SpatialHadoop system.  ... 
doi:10.1145/2525314.2525349 dblp:conf/gis/EldawyLMJ13 fatcat:nq2w2ryonjazbamidnakhomtwm

Accelerating Human-in-the-loop Machine Learning: Challenges and Opportunities [article]

Doris Xin, Litian Ma, Jialin Liu, Stephen Macke, Shuchen Song, Aditya Parameswaran
2018 arXiv   pre-print
We describe our vision for a "human-in-the-loop" ML system that accelerates this process: by intelligently tracking changes and intermediate results over time, such a system can enable rapid iteration,  ...  We finally describe Helix, our preliminary attempt at such a system that has already led to speedups of up to 10x on typical iterative workflows against competing systems.  ...  CONCLUSIONS We presented our vision for an efficient end-to-end ML system focused on supporting iterative, human-in-the-loop workflow development.  ... 
arXiv:1804.05892v1 fatcat:pu2ywdlvj5dddjtpnf7ncpqgey
« Previous Showing results 1 — 15 out of 26,123 results