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

12th IASTED international conference on artificial intelligence and Soft Computing, ASC 2008

作者： Acosta Guadarrama, J.C. Institute of Computer Science TU-Clausthal Germany

ISBN: (纸本)9780889867550

Updating agents' knowledge bases is an important topic in artificial intelligence and a key problem of knowledge representation and reasoning. One of the latest ideas to update logic programs is to use abduction by means of Minimal Generalised Answer Sets (MGAS). MGAS provide a more general and flexible semantics than standard ASP , and we propose it to overcome disadvantages of previous approaches as well as to simplify both the semantics definition and its implementation. Moreover, the author provides a link to a modest online prototype of the semantics here introduced. this prototype models updates in a well-known Disjunctive Datalog, DLV, which is an implementation (solver) for Answer Set programming. Accordingly, the two-fold contribution of this paper is showing a simpler theoretical framework characterised in DLV's weak constraints, as well as an outline of the basic structure of its implementation, description of the employed technology.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Modelling affective-based music compositional intelligence with the aid of ANS analyses

引用

KNOWLEDGE-BASED SYSTEMS 2008年第3期21卷 200-208页

作者： Sugimoto, Toshihito Legaspi, Roberto Ota, Akihiro Moriyama, Koichi Kurihara, Satoshi Numao, Masayuki Osaka Univ Inst Sci & Ind Res Osaka 5670047 Japan Osaka Univ Dept Informat Sci & Tech Suita Osaka 5650871 Japan

this research investigates the use of emotion data derived from analyzing change in activity in the autonomic nervous system (ANS) as revealed by brainwave production to support the creative music compositional intelligence of an adaptive interface. A relational model of the influence of musical events on the listener's affect is first induced using inductive logic programming paradigms with the emotion data and musical score features as inputs of the induction task. the components of composition such as interval and scale, instrumentation, chord progression and melody are automatically combined using genetic algorithm and melodic transformation heuristics that depend on the predictive knowledge and character of the induced model. Out of the four targeted basic emotional states, namely, stress, joy, sadness, and relaxation, the empirical results reported here show that the system is able to successfully compose tunes that convey one of these affective states. (c) 2007 Elsevier B.V. All rights reserved.

关键词： adaptive user interface EEG-based emotion spectrum analysis user modelling automated reasoning machine learning

来源：评论

学校读者我要写书评

暂无评论

Guest editorial: Special issue on inductive logic programming

引用

MACHINE LEARNING 2008年第2-3期70卷 119-120页

作者： Muggleton, Stephen Otero, Ramon Colton, Simon Univ London Imperial Coll Sci Technol & Med Dept Comp Computat Bioinformat Lab London SW7 2RH England Univ A Coruna Dept Comp Sci Artificial Intelligence Lab Coruna 15071 Spain

thrs special issue is associated with the 16th international conference of Inductive logic programming (ILP 2006), which represented a radical departure from previous years. Submissions were requested in two phases. the first phase involved submission of short papers (3 pages) which were then presented at the conference and included in a short papers proceedings. In the second phase, reviewers selected papers for long paper submission (15 pages maximum). these were then assessed by the same reviewers, who then decided which papers to include in the Journal Special Issue and Proceedings. In the first phase there were a record 77 papers, compared to the usual 20 or so long papers of previous years. Each paper was reviewed by 3 reviewers. Out of these, 71 were invited to submit long papers. Out of the long paper submissions, 7 were selected for the Machine Learning Journal Special Issue and 27 were accepted for the conference proceedings. In addition, two papers were nominated by PC referees for the applications prize and two for the theory prize. the papers in this special issue represent the diversity and vitality in present ILP research.

关键词： inductive logic programming Viability second phase international conference

来源：评论

学校读者我要写书评

暂无评论

Intelligent Computer Mathematics - 9th international conference, AISC 2008 - 15th Symposium, Calculemus 2008 - 7th international conference, MKM 2008, Proceedings

Intelligent Computer Mathematics - 9th International Confere...

引用

9th Int. Conf. artificial intelligence and Symbolic Computation, AISC 2008 - 15th Symposium on the Integration of Symbolic Computation and Mechanized reasoning, Calculemus 2008 - 7th Int. Conf. Mathematical Knowledge Management, MKM 2008

ISBN: (纸本)3540851097

the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism in the development of English-Indonesian machine translation system;case studies in model manipulation for scientific computing;mechanising a proof of Craig's interpolation theorem for intuitionistic logic in nominal Isabelle;ASIC meets natural typography;the monoids of order eight and nine;extending graphical representations for compact closed categories with applications to symbolic quantum computation;a full first-order constraint solver for decomposable theories;search techniques for rational polynomial orders;strategies for solving sat in grids by randomized search;towards an implementation of a computer algebra system in a functional language;and automated model building: from finite to infinite models.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Answer set programming with functions

Answer set programming with functions

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Lin, Fangzhen Wang, Yisong Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong Guizhou University Guiyang China Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

ISBN: (纸本)9781577353843

To compute a function such as a mapping from vertices to colors in the graph coloring problem, current practice in Answer Set programming is to represent the function as a relation. Among other things, this often makes the resulting program unnecessarily large when instantiated on a large domain. the extra constraints needed to enforce the relation as a function also make the logic program less transparent. In this paper, we consider adding functions directly to normal logic programs. We show that the answer set semantics can be generalized to these programs straightforwardly. We also show that the notions of loops and loop formulas can be extended, and that through program completion and loop formulas, a normal logic program with functions can be transformed to a Constraint Satisfaction problem. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

An ATP of a Relational Proof System for Order of Magnitude reasoning with Negligibility, Non-closeness and Distance

An ATP of a Relational Proof System for Order of Magnitude R...

引用

10th Pacific Rim international conference on artificial intelligence (PRICAI 2008)

作者： Golinska-Pilarek, Joanna Mora, Angel Munoz-Velasco, Emilio Warsaw Univ Inst Philosophy Inst Natl Telecommun Warsaw Poland Univ Malaga Dept Matemat Aplicada Malaga Spain

ISBN: (纸本)9783540891963

We introduce an Automatic theorem Prover (ATP) of a dual tableau system for a relational logic for order of magnitude qualitative reasoning, which allows us to deal with relations such as negligibility, non-closeness and distance. Dual tableau systems are validity checkers that can serve as a tool for verification of a variety of tasks in order of magnitude reasoning, such as the use of qualitative sum of some classes of numbers. In the design of our ATP, we have introduced some heuristics, such as the so called phantom variables, which improve the efficiency of the selection of variables used tin the proof.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

KeYmaera: A hybrid theorem prover for hybrid systems

引用

4th international Joint conference on Automated reasoning

作者： Platzer, Andre Quesel, Jan-David Carl von Ossietzky Univ Oldenburg Dept Comp Sci D-2900 Oldenburg Germany

ISBN: (纸本)9783540710691

KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies. It is an automated and interactive theorem prover for a natural specification and verification logic for hybrid systems. KeYmaera supports differential dynamic logic, which is a real-valued first-order dynamic logic for hybrid programs, a program notation for hybrid automata. For automating the verification process, KeYmaera implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically. To overcome the complexity of real arithmetic, we integrate real quantifier elimination following an iterative background closure strategy. Our tool is particularly suitable for verifying parametric hybrid systems and has been used successfully for verifying collision avoidance in case studies from train control and air traffic management.

关键词： dynamic logic automated theorem proving decision procedures computer algebra verification of hybrid systems

来源：评论

学校读者我要写书评

暂无评论

Conflict-driven disjunctive answer set solving

Conflict-driven disjunctive answer set solving

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Drescher, Christian Gebser, Martin Grote, Torsten Kaufmann, Benjamin König, Arne Ostrowski, Max Schaub, Torsten Institut für Informatik Universität Potsdam August-Bebel-Str. 89 D-14482 Potsdam Germany

ISBN: (纸本)9781577353843

We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on state-of-theart Boolean constraint solving techniques. Starting from a constraint-based characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflict-driven learning using the First-UIP scheme as well as sophisticated unfounded set checking. As a final result, we obtain a competitive solver for Σ2P -complete problems, taking advantage of Boolean constraint solving technology without using any legacy solvers as black boxes. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

TOWARDS CREATION OF logicAL FRAMEWORK FOR EVENT-DRIVEN INFORMATION SYSTEMS

TOWARDS CREATION OF LOGICAL FRAMEWORK FOR EVENT-DRIVEN INFOR...

引用

10th international conference on Enterprise Information Systems

作者： Anicic, Darko Stojanovic, Nenead Univ Karlsruhe Forsch Zentrum Informat FZI Karlsruhe Germany

ISBN: (纸本)9789898111388

Event-Condition-Action (ECA) rules offer extensible and flexible approach to realizing active Enterprise Information Systems. Such systems are enabled to actively respond on events or state changes. Hence their behavior is programable by means of ECA rules. We propose an implementation of ECA rules in a completely logical framework, using Transaction Datalog- as an underlying logic. In this way, we extend the current ECA framework by means of powerful and declarative semantics, which also have an appropriate procedural interpretation. We show how a logical calculus of Transaction Datalog- can be exploited for realizing composite events, conditions, and actions;justifying the use of declarative semantics for solving some of the existing issues in reactive systems.

关键词： Event-Condition-Action Rules Reactive Systems Rule-based reasoning logic programming

来源：评论

学校读者我要写书评

暂无评论

Computing loops with at most one external support rule

Computing loops with at most one external support rule

引用

11th international conference on Principles of Knowledge Representation and reasoning, KR 2008

作者： Chen, Xiaoping Ji, Jianmin Lin, Fangzhen University of Science and Technology China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9781577353843

If a loop has no external support rules, then its loop formula is equivalent to a set of unit clauses;and if it has exactly one external support rule, then its loop formula is equivalent to a set of binary clauses. In this paper, we consider how to compute these loops and their loop formulas in a normal logic program, and use them to derive consequences of a logic program. We show that an iterative procedure based on unit propagation, the program completion and the loop formulas of loops with no external support rules can compute the same consequences as the "Expand" operator in smodels, which is known to compute the well-founded model when the given normal logic program has no constraints. We also show that using the loop formulas of loops with at most one external support rule, the same procedure can compute more consequences, and these extra consequences can help ASP solvers such as cmodels to find answer sets of certain logic programs. Copyright © 2008, Association for the Advancement of artificial intelligence.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：