检索结果-内蒙古大学图书馆

27th international conference on Computer-Aided Verification (CAV)

作者： Manolios, Panagiotis Pais, Jorge Papavasileiou, Vasilis Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9783319216683;9783319216676

Our Mathematical programming Modulo theories (MPMT) constraint solving framework extends Mathematical programming technology with techniques from the field of Automated reasoning, e.g., solvers for first-order theories. In previous work, we used MPMT to synthesize system architectures for Boeing's Dreamliner and we studied the theoretical aspects of MPMT by means of the Branch and Cut Modulo T (BC(T)) transition system. BC(T) can be thought of as a blueprint for MPMT solvers. this paper provides a more practical and algorithmic view of BC(T). We elaborate on the design and features of Inez, our BC(T) constraint solver. Inez is an open-source, freely available superset of the OCaml programming language that uses the SCIP Branch and Cut framework to extend OCaml with MPMT capability. Inez allows users to write programs that arbitrarily interweave general computation with MPMT constraint solving.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Knowledge Base With Dependencies

A Knowledge Base With Dependencies

引用

the 2014 10th international conference on Natural Computation (ICNC 2014) and the 2014 11th international conference on Fuzzy Systems and Knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

作者： Chaohui Zhuang Department of Computer Science Xiamen UniversityXiamenP.R.China

ISBN: (纸本)9781479951499

Traditionally,knowledge is defined as justified true belief(JTB).However,Gettier Problem showed that JTB is not sufficient for *** paper argues that validity of knowledge has to depend on justifications of ***,justifications of knowledge have to be stored in knowledge base *** on Truth Maintenance Systems,this paper presents a novel knowledge representation system,*** bases with *** paper applies this idea to propositional logic *** a logic program,consequences together with their dependencies are computed and *** updating consequences set with dependencies,this paper proposes an algorithm of rule addition and two algorithms of rule *** second algorithm of rule deletion can handle the problem of circular *** bases with dependencies can provide a new foundation for belief revision and argument.

关键词： knowledge base dependencies logic program nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Manifold answer-set programs and their applications

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6565 LNAI卷 44-63页

作者： Faber, Wolfgang Woltran, Stefan University of Calabria Italy Vienna University of Technology Austria

ISBN: (纸本)9783642208317

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or cautious consequences of a program P1 as input to another program P 2 in order to provide the desired solutions to the problem to be solved. In practice, the evaluation of the program P1 currently has to be decoupled from the evaluation of P2 using an intermediate step which collects the desired consequences of P1 and provides them as input to P2. In this work, we present a novel method for representing such a procedure within a single program, and thus within the realm of ASP itself. Our technique relies on rewriting P1 into a so-called manifold program, which allows for accessing all desired consequences of P 1 within a single answer set. then, this manifold program can be evaluated jointly with P2 avoiding any intermediate computation step. For determining the consequences within the manifold program we use weak constraints, which is strongly motivated by complexity considerations. As applications, we present encodings for computing the ideal extension of an abstract argumentation framework and for computing world views of a particular class of epistemic specifications. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE international conference on Fuzzy Systems (FUZZ-IEEE)

作者： V. Loia S. Senatore M.I. Sessa Dipartimento Matematica e Informatica Universita di Salemo Baronissi Italy

this paper presents an extension of SLD resolution towards approximate reasoning. the proposed refutation procedure overcomes failures in the unification process by exploiting similarity relation defined between predicate and constant symbols. this enables to compute approximate solutions, with an associated approximation degree, when failures of the exact inference process occur. In this paper we outline the main ideas of this approach and we present an extended PROLOG interpreter, named SiLog, which implements this inference procedure.

关键词： Superluminescent diodes logic programming Fuzzy logic Fuzzy sets Natural languages Query processing Java Engines programming profession

来源：评论

学校读者我要写书评

暂无评论

Search space pruning by checking dynamic term growth 4th

引用

4th international conference on logic programming and Automated reasoning, LPAR 1993

作者： Brüning, Stefan FG Intellektik FB Informatik Technische Hochschule Darmstadt Alexanderstraße 10 DarmstadtD-6100 Germany

ISBN: (纸本)9783540569442

In this paper we present a method to detect non-terminating ox failing queries based on analyzing the dynamic growth of terms. It overcomes restrictions known from approaches to preclude infinite loops in the field of logic programming. the general idea is to predetermine what may happen to a term while performing inference steps. Various well-known techniques and results of the theory of formal languages are used. the strength of our technique is emphasized by the fact that using it we are able to decide Horn-formulas consisting of facts, two-literal clauses, and a goal literal all of them restricted to unary predicate and unary function symbols. © Springer-Verlag Berlin Heidelberg 1993.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Combining semantic web and logic programming for agent reasoning 11

Combining semantic web and logic programming for agent reaso...

引用

Proceedings of the 10th international conference on Advanced Agent Technology

作者： Murat Şensoy Wamberto W. Vasconcelos Timothy J. Norman Department of Computing Science University of Aberdeen Aberdeen UK

ISBN: (纸本)9783642272158

Web Ontology Language (OWL) provides means to semantically represent domain knowledge as ontologies. then, ontological reasoning allows software agents to effectively share and semantically interpret the knowledge. OWL adopts open world semantics and in order to achieve decidability its expressiveness is strictly limited. therefore, many real-life problems cannot be represented only using ontologies and cannot be solved using just ontological reasoning. On the other hand, traditional reasoning mechanisms for autonomous agents are mostly based on logic programming (LP) and closed world assumption. LP provides a very expressive formal language, however it requires domain knowledge to be encoded as a part of logic programs. In this paper, we propose Ontological logic programming (OLP), a novel approach that combines logic programming with ontological reasoning. the proposed approach enables the use of ontological terms (i.e., individuals, classes and properties) directly within logic programs. the interpretation of these terms are delegated to an ontology reasoner during the interpretation of the program. Unlike similar approaches, OLP makes use of the full capacity of both the ontological reasoning and logic programming. Using case-studies, we demonstrate the usefulness of OLP in multi-agent settings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Question answering via integer programming over semi-structured knowledge 25

Question answering via integer programming over semi-structu...

引用

25th international Joint conference on Artificial Intelligence, IJCAI 2016

作者： Khashabi, Daniel Khot, Tushar Sabharwal, Ashish Clark, Peter Etzioni, Oren Roth, Dan University of Illinois at Urbana-Champaign IL United States SeattleWA United States

Answering science questions posed in natural language is an important AI challenge. Answering such questions often requires non-trivial inference and knowledge that goes beyond factoid retrieval. Yet, most systems for this task are based on relatively shallow Information Retrieval (IR) and statistical correlation techniques operating on large unstructured corpora. We propose a structured inference system for this task, formulated as an Integer Linear Program (ILP), that answers natural language questions using a semi-structured knowledge base derived from text, including questions requiring multi-step inference and a combination of multiple facts. On a dataset of real, unseen science questions, our system significantly outperforms (+14%) the best previous attempt at structured reasoning for this task, which used Markov logic Networks (MLNs). It also improves upon a previous ILP formulation by 17.7%. When combined with unstructured inference methods, the ILP system significantly boosts overall performance (+10%). Finally, we show our approach is substantially more robust to a simple answer perturbation compared to statistical correlation methods.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

logic, Language, Information and Computation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540734451

ISBN: (纸本)9783540734437

Welcome to the proceedings of the 14th WoLLIC meeting, which was held in Rio de Janeiro, Brazil, July 2 - 5, 2007. the Workshop on logic, Language, Information and Computation (WoLLIC) is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. the WoLLIC meetings alternate between Brazil (and Latin America) and other countries, with the aim of fostering interest in applied logic among Latin Am- ican scientists and students, and facilitating their interaction with the international - plied logic community. WoLLIC 2007 focused on foundationsof computing and programming,novel c- putation models and paradigms, broad notions of proof and belief, formal methods in software and hardware development; logical approaches to natural language and r- soning; logics of programs, actions and resources; foundational aspects of information organization, search, ?ow, sharing, and protection. the Program Committee for this meeting, consisting of the 28 colleagues listed here, was designed to promote these inter-disciplinary and cross-disciplinary topics. Like its predecessors, WoLLIC 2007 included invited talks and tutorials as well as contributed papers. the Program Committee received 52 complete submissions (aside from 15 preliminary abstracts which did not materialize). A thorough review process by the Program Committee, assisted by over 70 external reviewers, led to the acc- tance of 21 papers for presentation at the meeting and inclusion in these proceedings. the conference program also included 16 talks and tutorials by 10 prominent invited speakers, who graciously accepted the Program Committee’s invitation.

关键词： theory of Computation Algorithm Analysis and Problem Complexity Mathematical logic and Formal Languages Mathematics of Computing Artificial Intelligence Algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Constraint Propagation Engines

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2008年第1期31卷 1–43页

作者： Schulte, Christian Stuckey, Peter J. KTH Royal Inst Technol Sch Informat & Commun Technol SE-16440 Kista Sweden Univ Melbourne Dept Comp Sci & Software Engn NICTA Victoria Lab Melbourne Vic 3010 Australia

this article presents a model and implementation techniques for speeding up constraint propagation. three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping track of which propagators are at fixpoint, choosing which propagator to apply next, and how to combine several propagators for the same constraint. We show how idempotence reasoning and events help track fixpoints more accurately. We improve these methods by using them dynamically (taking into account current variable domains to improve accuracy). We define priority-based approaches to choosing a next propagator and show that dynamic priorities can improve propagation. We illustrate that the use of multiple propagators for the same constraint can be advantageous with priorities, and introduce staged propagators that combine the effects of multiple propagators with priorities for greater efficiency.

关键词： Languages Design Experimentation Performance Constraint (logic) programming constraint propagation events finite domain constraints fixpoint reasoning priorities

来源：评论

学校读者我要写书评

暂无评论

Model-based knowledge representation and reasoning via answer set programming 08

Model-based knowledge representation and reasoning via answe...

引用

Proceedings of the 9th international conference on Functional and logic programming

作者： Torsten Schaub School of Computing Science Simon Fraser University Burnaby Canada and The Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia and Universität Potsdam Institut für Informatik Potsdam Germany

ISBN: (纸本)9783540789680

the field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and more popular nowadays. this development was primarily driven by the availability of highly efficient Boolean constraint solvers, like satisfiability and answer set solvers. the general idea is to translate an application problem into a logical specification. this specification is in turn passed to a solver, which outputs models representing solutions to the initial application *** talk will provide an introduction to answer set programming (ASP), its proof-theoretic foundations, methodology, implementation techniques along with a glimpse of an exemplary application. Besides knowledge representation and reasoning, ASP has its roots in deductive databases, nonmonotonic reasoning, and logic programming. Applications are specified in ASP in terms of sets of logical rules. Modern ASP solvers rely on high-performance Boolean constraint solving techniques, which allow them to tackle application domains consisting of millions of variables. Meanwhile, this approach proved to be an effective tool in a range of applications, like planning, model checking, and bio-informatics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：