发布求助
文献互助 智能选刊 最新文献

International Conference on Logic Programming最新文献

筛选
英文 中文
Applying Machine Learning Techniques to ASP Solving 将机器学习技术应用于ASP求解
International Conference on Logic Programming Pub Date : 2012-03-24 DOI: 10.4230/LIPIcs.ICLP.2012.37
M. Maratea, Luca Pulina, F. Ricca
{"title":"Applying Machine Learning Techniques to ASP Solving","authors":"M. Maratea, Luca Pulina, F. Ricca","doi":"10.4230/LIPIcs.ICLP.2012.37","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2012.37","url":null,"abstract":"Having in mind the task of improving the solving methods for Answer Set Programming (ASP), there are two usual ways to reach this goal: (i) extending state-of-the-art techniques and ASP solvers, or (ii) designing a new ASP solver from scratch. An alternative to these trends is to build on top of state-of- the-art solvers, and to apply machine learning techniques for choosing automatically the \"best\" available solver on a per-instance basis. \u0000 \u0000In this paper we pursue this latter direction. We first define a set of cheap-to-compute syntactic features that characterize several aspects of ASP programs. Then, given the features of the instances in a training set and the solvers performance on these instances, we apply a classification method to inductively learn algorithm selection strategies to be applied to a test set. We report the results of an experiment considering solvers and training and test sets of instances taken from the ones submitted to the \"System Track\" of the 3rd ASP competition. Our analysis shows that, by applying machine learning techniques to ASP solving, it is possible to obtain very robust performance: our approach can solve a higher number of instances compared with any solver that entered the 3rd ASP competition.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127296102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Yet Another Characterization of Strong Equivalence 强等价的另一个表征
International Conference on Logic Programming Pub Date : 2011-12-01 DOI: 10.4230/LIPIcs.ICLP.2011.11
A. Bochman, V. Lifschitz
{"title":"Yet Another Characterization of Strong Equivalence","authors":"A. Bochman, V. Lifschitz","doi":"10.4230/LIPIcs.ICLP.2011.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2011.11","url":null,"abstract":"Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132853762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Constraints in Non-Boolean Contexts 非布尔上下文中的约束
International Conference on Logic Programming Pub Date : 2011-12-01 DOI: 10.4230/LIPIcs.ICLP.2011.117
L. Koninck, S. Brand, Peter James Stuckey
{"title":"Constraints in Non-Boolean Contexts","authors":"L. Koninck, S. Brand, Peter James Stuckey","doi":"10.4230/LIPIcs.ICLP.2011.117","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2011.117","url":null,"abstract":"In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints. \u0000We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Timed Definite Clause Omega-Grammars 限时定句语法
International Conference on Logic Programming Pub Date : 2010-12-01 DOI: 10.4230/LIPIcs.ICLP.2010.212
N. Saeedloei, G. Gupta
{"title":"Timed Definite Clause Omega-Grammars","authors":"N. Saeedloei, G. Gupta","doi":"10.4230/LIPIcs.ICLP.2010.212","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2010.212","url":null,"abstract":"We propose timed context-free grammars (TCFGs) and show how parsers for such grammars can be developed using denite clause grammars (DCGs) coupled with constraints over reals (CLP(R)). Timed context-free grammars describe timed context- free languages (TCFLs). We next extend timed context-free grammars to timed context- free !-grammars (!-TCFGs for brevity) and incorporate co-inductive logic programming in DCGs to obtain parsers for them. Timed context-free !-grammars describe timed context- free languages containing innite-sized words, and are a generalization of timed !-regular languages recognized by timed automata. We show a practical application of !-TCFGs to the well-known generalized railroad crossing problem.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125809053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Dedicated Tabling for a Probabilistic Setting 用于概率设置的专用表
International Conference on Logic Programming Pub Date : 2010-06-25 DOI: 10.4230/LIPIcs.ICLP.2010.124
Theofrastos Mantadelis, Gerda Janssens
{"title":"Dedicated Tabling for a Probabilistic Setting","authors":"Theofrastos Mantadelis, Gerda Janssens","doi":"10.4230/LIPIcs.ICLP.2010.124","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2010.124","url":null,"abstract":"ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a sum of products. ProbLog applies advanced techniques to make this feasible and to assess the correct probability. Tabling is a well-known technique to avoid repeated subcomputations and to terminate loops. We investigate how tabling can be used in ProbLog. The challenge is that we have to reconcile tabling with the advanced ProbLog techniques. While standard tabling collects only the answers for the calls, we do need the SLD proof tree. Finally we discuss how to deal with loops in our probabilistic framework. By avoiding repeated subcomputations, our tabling approach not only improves the execution time of ProbLog programs, but also decreases accordingly the memory consumption. We obtain promising results for ProbLog programs using exact probability inference.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Two Phase Description Logic Reasoning for Efficient Information Retrieval 高效信息检索的两阶段描述逻辑推理
International Conference on Logic Programming Pub Date : 2010-05-30 DOI: 10.4230/LIPIcs.ICLP.2011.296
Zsolt Zombori
{"title":"Two Phase Description Logic Reasoning for Efficient Information Retrieval","authors":"Zsolt Zombori","doi":"10.4230/LIPIcs.ICLP.2011.296","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2011.296","url":null,"abstract":"Description Logics (DLs) [1] is family of logic languages designed to be a convenient means of knowledge representation. They can be embedded into FOL, but - contrary to the latter - they are decidable which gives them a great practical applicability. A DL knowledge base consists of two parts: the TBox (terminology box) and the ABox (assertion box). The TBox contains general background knowledge in the form of rules that hold in a specific domain. The ABox stores knowledge about individuals. For example, let us imagine an ontology about the structure of a university. The TBox might contain statements like “Every department has exactly one chair”, “Departments are responsible for at least 4 courses and for each course there is a department responsible for it”. In contrast, the ABox might state that “The Department of Computer Science is responsible for the course Information Theory” or that “Andrew is the chair of the the Department of Music”.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116132030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization 利用程序专门化提高概率逻辑模型吉布斯抽样的效率
International Conference on Logic Programming Pub Date : 2010-04-01 DOI: 10.4230/LIPIcs.ICLP.2010.74
Daan Fierens
{"title":"Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization","authors":"Daan Fierens","doi":"10.4230/LIPIcs.ICLP.2010.74","DOIUrl":"https://doi.org/10.4230/LIPIcs.ICLP.2010.74","url":null,"abstract":"There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From a computational perspective, Gibbs sampling boils down to repeatedly executing certain queries on a knowledge base composed of a static part and a dynamic part. The larger the static part, the more redundancy there is in these repeated calls. This is problematic since inefficient Gibbs sampling yields poor approximations. \u0000We show how to apply program specialization to make Gibbs sampling more efficient. Concretely, we develop an algorithm that specializes the definitions of the query-predicates with respect to the static part of the knowledge base. In experiments on real-world benchmarks we obtain speedups of up to an order of magnitude.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125597722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Execution Control for CHR CHR的执行控制
International Conference on Logic Programming Pub Date : 2009-07-24 DOI: 10.1007/978-3-642-02846-5_38
L. Koninck
{"title":"Execution Control for CHR","authors":"L. Koninck","doi":"10.1007/978-3-642-02846-5_38","DOIUrl":"https://doi.org/10.1007/978-3-642-02846-5_38","url":null,"abstract":"","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Untangling Reverse Engineering with Logic and Abstraction 用逻辑和抽象解开逆向工程的纠缠
International Conference on Logic Programming Pub Date : 2009-07-24 DOI: 10.1007/978-3-642-02846-5_6
Andy King
{"title":"Untangling Reverse Engineering with Logic and Abstraction","authors":"Andy King","doi":"10.1007/978-3-642-02846-5_6","DOIUrl":"https://doi.org/10.1007/978-3-642-02846-5_6","url":null,"abstract":"","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129133650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
User Defined Indexing 用户自定义索引
International Conference on Logic Programming Pub Date : 2009-07-24 DOI: 10.1007/978-3-642-02846-5_31
David Vaz, V. S. Costa, Michel Ferreira
{"title":"User Defined Indexing","authors":"David Vaz, V. S. Costa, Michel Ferreira","doi":"10.1007/978-3-642-02846-5_31","DOIUrl":"https://doi.org/10.1007/978-3-642-02846-5_31","url":null,"abstract":"","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"52-54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123644586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信