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

19th international conference on Web Engineering (ICWE)

作者： Cristani, Matteo Univ Verona Dipartimento Informat Verona Italy

ISBN: (纸本)9783030192747;9783030192730

In this tutorial we describe the approaches to non monotonic reasoning as a means for inference on the web. In particular we are focusing on the ways in which reasoning technologies have adapted to five different issues of the modern era world wide web: (a) epistemic aspects, bound by the new models of the social web, (b) changes over time, (c) language variants, including different languages of deployment of a web site, (d) agent-based knowledge deployment, due to social networks and blogs, (e) dialogue aspects, introduced again in blogs and social networks. the presentation covers these aspects by a technical viewpoint, including the introduction of specific knowledge-driven methods. the technical issues will be provided within a general logical framework known as defeasible logic.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Probabilistic finite domains: A brief overview 18th

引用

18th international conference on logic programming

作者： Angelopoulos, N Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England

ISBN: (纸本)3540439307

We propose a new way of extending logic programming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities of the LP engine. Unlike other approaches to the field, Pfd syntax can be intuitively related to the axioms defining Probability and to the underlying concepts of Probability theory, (PT) such as sample space, events, and probability function. Probabilistic variables are core computational units and have two parts. Firstly, a finite domain, which at each stage holds the collection of possible values that can be assigned to the variable, and secondly a probabilistic function that can be used to assign probabilities to the elements of the domain. the two constituents are kept in isolation from each other. there are two benefits in such an approach. Firstly, that propagation techniques from finite domains research are retained, since a domain̵7;s representation is not altered. thus, a probabilistic variable continues to behave as a finite domain variable. Secondly, that the probabilistic function captures the probabilistic behaviour of the variable in a manner which is, to a large extent, independent of the particular domain values. the notion of events as used in PT can be captured by LP predicates containing probabilistic variables and the derives operator (⊢) as defined in LP. Pfd stores hold conditional constraints which are a computationally useful restriction of conditional probability from PT. Conditional constraints are defined by D₁: π₁⊕...⊕D_n: π_n | Q₁ 743;...743; Q_m where, D_i and Q_j are predicates and each π_i is a probability measure (0 ≤ π_i ≤ 1, 1 ≤ i ≤ n, 1 ≤ j ≤ m). the conjuction of Q_j̵7;s qualifies probabilistic knowledge about D_i<

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A generic complete dynamic logic for reasoning about purity and effects

引用

11th international conference on Fundamental Approaches to Software Engineering

作者： Mossakowski, Till Schroeder, Lutz Goncharov, Sergey DFKI Lab Bremen Germany Univ Bremen Dept Comp Sci Bremen Germany

ISBN: (纸本)9783540787426

For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are typically formulated using potentially effectful programs. In order to ensure that these pre- and postconditions behave like logical formulae (that is, enjoy some kind of referential transparency), a notion of purity is needed. Here, we introduce a generic framework for reasoning about purity and effects. Effects are modeled abstractly and axiomatically, using Moggi's idea of encapsulation of effects as monads. We introduce a dynamic logic (from which, as usual, a Hoare logic can be derived) whose logical formulae are pure programs in a strong sense. We formulate a set of proof rules for this logic, and prove it to be complete with respect to a categorical semantics. Using dynamic logic, we then develop a relaxed notion of purity which allows for observationally neutral effects such writing on newly allocated memory.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

4th international conference on HCI in Business, Government and Organizations, HCIBGO 2017, held as part of the 19th international conference on Human-Computer Interaction , HCI 2017

4th International Conference on HCI in Business, Government ...

引用

14th international conference on logic programming and nonmonotonic reasoning, LPNMR 2017

ISBN: (纸本)9783319584836

the proceedings contain 66 papers. the special focus in this conference is on HCI in Business, Government and Organizations. the topics include: Sharing economy versus access economy;employing relation visualizations to enhance the shopping experience on a used car trading platform;the effects of scarcity messages on online impulsive purchase;a survey based on the octalysis framework;priming and context effects of banner ads on consumer based brand equity;effect of timing and source of online product recommendations;optimize the coupon face value for online sellers;acceptance of personalization in omnichannel retailing;eye-tracking analysis of gender-specific online information research and buying behavior;participation in collaborative consumption;dueling for trust in the online fantasy sports industry;a longitudinal analysis;a theoretical model of incorporating gamification design into on-line marketing;extracting important knowledge from multiple markets using transfer learning;numbers speak where words fail;perceptions from security guards;the duality of envy in online social information consumption;context sensitive digital marketing;encouraging the participation in mobile collaborative consumption using gamification design;development of an online checklist for the assessment of alarm systems and alarm management in process control;impact of mobile it consumerization on organizations;a review on neuropsychophysiological correlates of flow;contract visualisation and a transaction cost equilibrium analysis on overlap between emergency response task groups.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adapting Approximation Fixpoint theory to Nondeterministic Hybrid reasoning 40

Adapting Approximation Fixpoint Theory to Nondeterministic H...

引用

Workshop of the 40th international conference on logic programming, ICLP-WS 2024

作者： Killen, Spencer You, Jia-Huai University of Alberta Edmonton Canada

Approximation fixpoint theory (AFT) is an abstract, algebraic framework for the study of operators and their fixpoints on bilattices. It is based on approximating operators (approximators for short) and has seen application in expressing semantics for a variety of nonmonotonic languages. the original AFT only treats consistent, symmetric, and exact approximators. Consequently, it lacks the means to deal with inconsistencies which may arise naturally in systems of hybrid reasoning. this problem was addressed by a generalization of AFT by Liu and You [1], which alters the exactness condition so that inconsistencies can be supported. However, neither the original AFT nor this generalized AFT is capable of expressing nondeterministic semantics, which is essential for characterizing disjunctive knowledge. the recent proposal of nondeterministic AFT by Heyninck et al. [2] only deals with consistent and exact approximations, and its definitions of orderings, fixpoints, and monotonicity deviate from that of the original AFT. Due to differences in these core definitions, it is highly challenging, if not impossible, to generalize nondeterministic AFT to handle inconsistencies. In this paper, we present a new framework which relies on a family of approximators in Liu and You’s formulation to express nondeterministic semantics abstractly and algebraically. As an application, we show how to capture the partial stable semantics of (disjunctive) hybrid MKNF knowledge bases. © 2024 Copyright for this paper by its authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

three lessons in creating a knowledge base to enable reasoning, explanation and dialog 1

Three lessons in creating a knowledge base to enable reasoni...

引用

1st Workshop on Natural Language Processing and Automated reasoning, NLPAR 2013 - Co-located with 12th international conference on logic programming and nonmonotonic reasoning, LPNMR 2013

作者： Chaudhri, Vinay K. Dinesh, Nikhil Inclezan, Daniela Artificial Intelligence Center SRI International Menlo ParkCA94025 United States

Our work is driven by the hypothesis that for a program to answer questions, explain the answers, and engage in a dialog just like a human does, it must have an explicit representation of knowledge. Such explicit representations occur naturally in many situations such as engineering designs created by engineers, a software requirement created in unified modeling language or a process flow diagram for a manufacturing process. Automated approaches based on natural language processing have progressed on tasks such as named entity recognition, fact extraction and relation learning. Use of automated methods can be problematic in situations where the conceptual distinctions used by humans for reasoning are not directly expressed in natural language or when the representation must be used to drive a high fidelity simulation. In this paper, we report on our effort to systematically curate a knowledge base for substantial fraction of text in a biology textbook [26]. While this experience and the process is interesting on its own, three aspects can be especially instructive for future development of knowledge bases by both manual and automatic methods: (1) Consider imposing a simplifying abstract structure on natural language sentences so that the surface form is closer to the target logical form to be extracted. (2) Adopt an upper ontology that is strongly motivated and influenced by natural language. (3) Develop a set of guidelines that captures how the conceptual distinctions in the ontology may be realized in natural language. Since the representation created by this process has been quite effective for answering questions and producing explanations, it gives a concrete target for what information should be extracted by the automated methods.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

reasoning Under Uncertainty in Knowledge Graphs 4th

Reasoning Under Uncertainty in Knowledge Graphs

引用

4th international Joint conference on Web reasoning and Rule Systems (RR) conference / international Web Rule Symposia (RuleML)

作者： Bellomarini, Luigi Laurenza, Eleonora Sallinger, Emanuel Sherkhonov, Evgeny Banca Italia Rome Italy TU Wien Vienna Austria Univ Oxford Oxford England

ISBN: (纸本)9783030579777;9783030579760

We provide a framework for probabilistic reasoning in Vadalog-based Knowledge Graphs (KGs), able to satisfy the requirements of ontological reasoning: full recursion, powerful existential quantification, and the ability to express inductive definitions. Vadalog is based on Warded Datalog+/-, an existential rule language that strikes a good balance between computational complexity: with tractable reasoning in data complexity, and expressive power covering SPARQL under set semantics and the entailment regime for OWL 2 QL. Vadalog and its logical core Warded Datalog+/- are not covered by existing probabilistic programming and statistical relational models for many reasons including weak support for existentials, recursion and the impossibility to express inductive definitions. We introduce Soft Vadalog, a probabilistic extension to Vadalog satisfying these desiderata. It defines a probability distribution over the nodes of a chase network, a structure induced by the grounding of a Soft Vadalog program with the chase procedure.

关键词： Knowledge Graphs reasoning Markov logic Networks

来源：评论

学校读者我要写书评

暂无评论

Aspartame: Solving constraint satisfaction problems with answer set programming 1

引用

13th international conference on logic programming and nonmonotonic reasoning, LPNMR 2015

作者： Banbara, Mutsunori Gebser, Martin Inoue, Katsumi Ostrowski, Max Peano, Andrea Schaub, Torsten Soh, Takehide Tamura, Naoyuki Weise, Matthias Aalto University HIIT Greater Helsinki Finland INRIA Rennes Rennes France Kobe University Kobe Japan NII Tokyo Tokyo Japan University of Ferrara Ferrara Italy University of Potsdam Potsdam Germany

ISBN: (数字)9783319232645

ISBN: (纸本)9783319232638

Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective by the award-winning sugar system. We here develop an alternative approach based on ASP that serves two purposes. First, it provides a library for solving CSPs as part of an encompassing logic program. Second, it furnishes an ASP-based CP solver similar to sugar. Both tasks are addressed by using first-order ASP encodings that provide us with a high degree of flexibility, either for integration within ASP or for easy experimentation with different implementations. When used as a CP solver, the resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. the obtained set of facts is then combined with an ASP encoding that can be grounded and solved by off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting aspartame and sugar. © Springer international Publishing Switzerland 2015.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

the complexity of clausal fragments of LTL

The complexity of clausal fragments of LTL

引用

19th international conference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2013

作者： Artale, Alessandro Kontchakov, Roman Ryzhikov, Vladislav Zakharyaschev, Michael KRDB Research Centre Free University of Bozen-Bolzano I-39100 Bolzano Italy Department of Computer Science and Information Systems Birkbeck University of London London WC1E 7HX United Kingdom

We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (,

ISBN: (纸本)9783642452208

We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (,

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Automatic music composition using answer set programming

引用

thEORY AND PRACTICE OF logic programming 2011年第2-3期11卷 397-427页

作者： Boenn, Georg Brain, Martin De Vos, Marina Ffitch, John Univ Glamorgan Cardiff Sch Creat & Cultural Ind Pontypridd CF37 1DL M Glam Wales Univ Bath Dept Comp Sci Bath BA2 7AY Avon England

Music composition used to be a pen and paper activity. these days music is often composed with the aid of computer software, even to the point where the computer composes parts of the score autonomously. the composition of most styles of music is governed by rules. We show that by approaching the automation, analysis and verification of composition as a knowledge representation task and formalising these rules in a suitable logical language, powerful and expressive intelligent composition tools can be easily built. this application paper describes the use of answer set programming to construct an automated system, named Anton, that can compose melodic, harmonic and rhythmic music, diagnose errors in human compositions and serve as a computer-aided composition tool. the combination of harmonic, rhythmic and melodic composition in a single framework makes Anton unique in the growing area of algorithmic composition. With near real-time composition, Anton reaches the point where it can not only be used as a component in an interactive composition tool but also has the potential for live performances and concerts or automatically generated background music in a variety of applications. With the use of a fully declarative language and an "off-the-shelf" reasoning engine, Anton provides the human composer a tool which is significantly simpler, more compact and more versatile than other existing systems.

关键词： Answer set programming Applications of ASP Music composition Algorithmic composition Harmonic and melodic composition Diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：