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

Negation as a Resource: a Novel View on answer set Semantics

FUNDAMENTA INFORMATICAE 2015年第3-4期140卷 279-305页

作者： Costantini, Stefania Formisano, Andrea Univ Aquila DISIM I-67100 Laquila Italy Univ Perugia DMI I-06100 Perugia Italy

In recent work, we provided a formulation of ASP programs in terms of linear logic theories. answer sets were characterized in terms of maximal tensor conjunctions provable from such theories. In this paper, we propose a full comparison between answer set Semantics and its variation obtained by interpreting literals (including negative literals) as resources, which leads to a different interpretation of negation. We argue that this novel view can be of both theoretical and practical interest, and we propose a modified answer set Semantics that we call Resource-based answer set Semantics. An advantage is that of avoiding inconsistencies, as every program has a (possibly empty) resource-based answer set. This implies however the introduction of a different way of representing constraints. We provide a characterization of the new semantics as a variation of the answer set semantics, and also in terms of Autoepistemic Logic. The latter characterization leads to a way of computing resource-based answer set via answer set solvers.

关键词： answer set programming Default Negation Linear Logic Autoepistemic Logic

来源：评论

学校读者我要写书评

暂无评论

Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第5-6期17卷 780-799页

作者： Cuteri, Bernardo Dodaro, Carmine Ricca, Francesco Schueller, Peter Univ Calabria DeMaCS Arcavacata Di Rende Italy Univ Genoa Genoa Italy Marmara Univ Fac Engn Istanbul Turkey TU Wien Knowledge Based Syst Grp Inst Informat Syst Vienna Austria

answer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.

关键词： answer set programming lazy grounding propagators

来源：评论

学校读者我要写书评

暂无评论

Technical Note Temporal logic programs with variables

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第2期17卷 226-243页

作者： Aguado, Felicidad Cabalar, Pedro Perez, Gilberto Vidal, Concepcion Dieguez, Martin Univ A Coruna Dept Comp Sci La Coruna Spain Univ Paul Sabatier IRIT Toulouse France

In this note, we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic, an extension of answer set programming for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of Temporal Equilibrium Logic that shares the syntax of first-order Linear-time Temporal Logic but has different semantics, selecting some Linear-time Temporal Logic models we call temporal stable models. Then, we consider a subclass of theories (called splittable temporal logic programs) that are close to usual logic programs but allowing a restricted use of temporal operators. In this setting, we provide a syntactic definition of safe variables that suffices to show the property of domain independence - that is, addition of arbitrary elements in the universe does not vary the set of temporal stable models. Finally, we present a method for computing the derivable facts by constructing a non-temporal logic program with variables that is fed to a standard answer set programming grounder. The information provided by the grounder is then used to generate a subset of ground temporal rules which is equivalent to (and generally smaller than) the full program instantiation.

关键词： artificial intelligence knowledge representation temporal logic grounding logic programming answer set programming

来源：评论

学校读者我要写书评

暂无评论

Enablers and inhibitors in causal justifications of logic programs

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第1期17卷 49-74页

作者： Cabalar, Pedro Fandinno, Jorge Univ A Coruna Dept Comp Sci A Corunna Spain

In this paper, we propose an extension of logic programming where each default literal derived from the well-founded model is associated to a justification represented as an algebraic expression. This expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively call enablers and inhibitors, are intimately related to default negation and have an essentially different nature from regular cause-effect relations. The most important result is a formal comparison to the recent algebraic approaches for justifications in logic programming: Why-not Provenance and Causal Graphs. We show that the current approach extends both Why-not Provenance and Causal Graphs justifications under the well-founded semantics and, as a byproduct, we also establish a formal relation between these two approaches.

关键词： causal justifications well-founded semantics stable models answer set programming

来源：评论

学校读者我要写书评

暂无评论

Verification for ASP denotational semantics: A case study using the PVS theorem prover

引用

LOGIC JOURNAL OF THE IGPL 2017年第2期25卷 195-213页

作者： Aguado, F. Ascariz, P. Cabalar, P. Perez, G. Vidal, C. Univ A Coruna Dept Comp Sci La Coruna Spain

In this article, we present an encoding of the (recently proposed) denotational semantics for answer set programming (ASP) and its monotonic basis into the input language of the theorem prover PVS. Using some libraries and features from PVS, we have obtained semi-automated proofs for several fundamental properties of ASP. In this way, to the best of our knowledge, we provide the first known application of formal verification to ASP.

关键词： answer set programming theorem proving formal verification PVS denotational semantics.

来源：评论

学校读者我要写书评

暂无评论

Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2019年第1期25卷 438-448页

作者： Moritz, Dominik Wang, Chenglong Nelson, Greg L. Lin, Halden Smith, Adam M. Howe, Bill Heer, Jeffrey Univ Washington Seattle WA 98195 USA Univ Calif Santa Cruz Santa Cruz CA 95064 USA

There exists a gap between visualization design guidelines and their application in visualization tools. While empirical studies can provide design guidance, we lack a formal framework for representing design knowledge, integrating results across studies, and applying this knowledge in automated design tools that promote effective encodings and facilitate visual exploration. We propose modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data. Using constraints, we can take theoretical design knowledge and express it in a concrete, extensible, and testable form: the resulting models can recommend visualization designs and can easily be augmented with additional constraints or updated weights. We implement our approach in Draco, a constraint-based system based on answer set programming (ASP). We demonstrate how to construct increasingly sophisticated automated visualization design systems, including systems based on weights learned directly from the results of graphical perception experiments.

关键词： Automated Visualization Design Perceptual Effectiveness Constraints Knowledge Bases answer set programming

来源：评论

学校读者我要写书评

暂无评论

The External Interface for Extending WASP

引用

THEORY AND PRACTICE OF LOGIC programming 2020年第2期20卷 225-248页

作者： Dodaro, Carmine Ricca, Francesco Univ Genoa DIBRIS Genoa Italy Univ Calabria DEMACS Arcavacata Di Rende Italy

answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the conflict-driven clause learning (CDCL) backtracking search algorithm. Recent work suggested that the performance of CDCL-based implementations can be considerably improved on specific benchmarks by extending their solving capabilities with custom heuristics and propagators. However, embedding such algorithms into existing systems requires expert knowledge of the internals of ASP implementations. The development of effective solver extensions can be made easier by providing suitable programming interfaces. In this paper, we present the interface for extending the CDCL-based ASP solver wasp. The interface is bothgeneral, that is, it can be used for providing either new branching heuristics or propagators, andexternal, that is, the implementation of new algorithms requires no internal modifications of wasp. Moreover, we review the applications of the interface witnessing it can be successfully used to extend wasp for solving effectively hard instances of both real-world and synthetic problems.

关键词： knowledge representation and reasoning answer set programming application programming interface propagators choice heuristics

来源：评论

学校读者我要写书评

暂无评论

Towards a qualitative theory of the interruption of eating behavior change

引用

JOURNAL OF THEORETICAL BIOLOGY 2024年 581卷 111731页

作者： Dague, Philippe Muller, Laurent Pauleve, Loic Irigoin-Guichandut, Marc Univ Paris Saclay CNRS ENS Paris Saclay Lab Methodes Formelles 4 Ave Sci F-91190 Gif Sur Yvette France Univ Lorraine APEMAC F-57045 Metz France Univ Bordeaux CNRS Bordeaux INP LaBRI 351 Cours Liboat F-33405 Talence France Hop La Pitie Salpetriere Assistance Publ Hop Paris 47-83 Bd Hop F-75013 Paris France

The poor maintenance of eating behavior change is one of the main obstacles to minimizing weight regain after weight loss during diets for non-surgical care of obese or overweight patients. We start with a known informal explanation of interruption in eating behavior change during severe restriction and formalize it as a causal network involving psychological variables, which we extend with energetic variables governed by principles of thermodynamics. The three core phenomena of dietary behavior change, i.e., non-initiation, initiation followed by discontinuation and initiation followed by non-discontinuation, are expressed in terms of the value of the key variable representing mood or psychological energy, the fluctuation of which is the result of three causal relationships. Based on our experimental knowledge of the time evolution profile of the three causal input variables, we then proceed to a qualitative analysis of the resulting theory, i.e., we consider an overapproximation of it which, after discretization, can be expressed in the form of a finite integer-based model. Using answer set programming, we show that our formal model faithfully reproduces the three phenomena and, under a certain assumption, is minimal. We generalize this result by providing all the minimal models reproducing these phenomena when the possible causal relationships exerted on mood are extended to all the other variables (not just those assumed in the informal explanation), with arbitrary causality signs. Finally, by a direct analytical resolution of an under-approximation of our theory, obtained by assuming linear causalities, as a system of linear ODEs, we find exactly the same minimal models, proving that they are also equal to the actual minimal models of our theory since these are framed below and above by the models of the underapproximation and the over-approximation. We determine which parameters need to be person-specific and which can be considered invariant, i.e., we explain

关键词： Behavior change Hypocaloric diet Formal theory Thermodynamics Causal network Over-/under-approximation Discretization Qualitative reasoning Timescale Inter-individual variability answer set programming

来源：评论

学校读者我要写书评

暂无评论

Knowledge-based multi-criteria optimization to support indoor positioning

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2011年第3-4期62卷 345-370页

作者： Mileo, Alessandra Schaub, Torsten Merico, Davide Bisiani, Roberto Natl Univ Ireland Digital Enterprise Res Inst Galway Ireland Univ Potsdam Inst Informat D-14439 Potsdam Germany Univ Milano Bicocca NOMADIS Res Lab Dept Informat Syst & Commun I-20126 Milan Italy

Indoor position estimation constitutes a central task in home-based assisted living environments. Such environments often rely on a heterogeneous collection of low-cost sensors whose diversity and lack of precision has to be compensated by advanced techniques for localization and tracking. Although there are well established quantitative methods in robotics and neighboring fields for addressing these problems, they lack advanced knowledge representation and reasoning capacities. Such capabilities are not only useful in dealing with heterogeneous and incomplete information but moreover they allow for a better inclusion of semantic information and more general homecare and patient-related knowledge. We address this problem and investigate how state-of-the-art localization and tracking methods can be combined with answer set programming, as a popular knowledge representation and reasoning formalism. We report upon a case-study and provide a first experimental evaluation of knowledge-based position estimation both in a simulated as well as in a real setting.

关键词： Knowledge representation answer set programming Wireless Sensor Networks Localization Tracking

来源：评论

学校读者我要写书评

暂无评论

P-log: refinement and a new coherency condition

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2019年第1-3期86卷 149-192页

作者： Balai, Evgenii Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79409 USA

This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly modify the formal semantics to better match the intuitive meaning of the language constructs. We also define a new class of coherent (i.e., logically and probabilistically consistent) P-log programs which facilitates their construction and proofs of correctness. There are a query answering algorithm, sound for programs from this class, and a prototype implementation which, due to their size, are not included in the paper. They, however, can be found in the dissertation of the first author.

关键词： answer set programming Probabilistic inference Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：