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

21st Signal Processing and Communications Applications Conference (SIU)

作者： Aker, Erdi Patoglu, Volkan Erdem, Esra Sabanci Univ Muhendislik & Doga Bilimleri Fak Istanbul Turkey

ISBN: (纸本)9781467355636;9781467355629

answer set programming (ASP) is a knowledge representation and reasoning paradigm with high-level expressive logic-based formalism, and efficient solvers;it is applied to solve hard problems in various domains, such as, systems biology, wire routing, space shuttle control. In this paper, we present an application of ASP to housekeeping robotics, by showing how the following problems are addressed using computational methods/tools of ASP: 1) embedding commonsense knowledge automatically extracted from the commonsense knowledge base ConceptNet, into high-level representation, 2) embedding (continuous) geometric reasoning and temporal reasoning about durations of actions, into (discrete) high-level reasoning. We illustrate the applicability of ASP on several housekeeping robotics problems.

关键词： Knowledge representation reasoning housekeeping robotics answer set programming commonsense knowledge

来源：评论

学校读者我要写书评

暂无评论

Rethinking answer set programming Templates 26th

Rethinking Answer Set Programming Templates

引用

26th International Symposium on Practical Aspects of Declarative Languages (PADL)

作者： Alviano, Mario Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031520372;9783031520389

In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest. Code is cleaner and more secure because any implicit assumption is removed in favor of invariants, thus enabling a fail fast mindset and the immediate reporting of unexpected conditions. This article introduces a notion of template for answer set programming that, in addition to the don't repeat yourself principle, enforces locality of some predicates by means of a simple naming convention. Local predicates are mapped to the usual global namespace adopted bymainstream engines, using universally unique identifiers to avoid name clashes. This way, local predicates can be used to enforce invariants on the expected outcome of a template in a possibly empty context of application, independently by other rules that can be added to such a context. Template applications transpiled this way can be processed by mainstream engines and safely shared with other knowledge designers, even when they have zero knowledge of templates.

关键词： answer set programming secure coding clean code Domain-Driven Design Test-Driven Development

来源：评论

学校读者我要写书评

暂无评论

Addressing marketplace logistic tasks in answer set programming

引用

INTELLIGENZA ARTIFICIALE 2024年第2期18卷 261-278页

作者： Alviano, Mario Amendola, Danilo Reiners, Luis Angel Rodriguez Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy Oliveru Smartly Engn Arcavacata Di Rende Italy European Commiss Joint Res Ctr Geel Belgium

Marketplaces bring together products from multiple providers and automatically manage orders that involve several suppliers. We document the use of answer set programming to automatically choose products from various warehouses within a marketplace network to fulfill a specified order. The proposed solution seamlessly adapts to various objective functions utilized at different stages of order management, leading to cost savings for customers and simplifying logistics for both the marketplace and its suppliers.

关键词： answer set programming combinatorial search and optimization logistics marketplace

来源：评论

学校读者我要写书评

暂无评论

Modelling Assembly Line Balancing Problem in answer set programming

Modelling Assembly Line Balancing Problem in Answer Set Prog...

引用

International Conference on Computational Science and Computational Intelligence (CSIC)

作者： El-Khatib, Omar Taif Univ Dept Comp Sci At Taif Saudi Arabia

ISBN: (纸本)9781509055104

answer set programming (ASP) is a new programming language paradigm combining the declarative aspect with non-monotonic reasoning. In this paper, we will investigate and evaluate an application of Simple Assembly Line Balancing Problem in answer set programming. The problem is a highly combinatorial and is generally solved by specific programs. We present an approach to solve the simple assembly line balancing problem in answer set programming and compare them with the standard ones. It turns out that, although answer set programming greatly simplifies the problem statement. It is comparable in efficiency to specialized programs.

关键词： Simple assembly line balancing problem answer set programming Logic programming SALBP

来源：评论

学校读者我要写书评

暂无评论

An Advanced answer set programming Encoding for Nurse Scheduling 16th

An Advanced Answer Set Programming Encoding for Nurse Schedu...

引用

16th International Conference of the Italian Association for Artificial Intelligence (AI*IA)

作者： Alviano, Mario Dodaro, Carmine Maratea, Marco Univ Calabria DEMACS Arcavacata Di Rende Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783319701691;9783319701684

The goal of the Nurse Scheduling Problem (NSP) is to find an assignment of nurses to shifts according to specific requirements. Given its practical relevance, many researchers have developed different strategies for solving several variants of the problem. One of such variants was recently addressed by an approach based on answer set programming (ASP), obtaining promising results. Nonetheless, the original ASP encoding presents some intrinsic weaknesses, which are identified and eventually circumvented in this paper. The new encoding is designed by taking into account both intrinsic properties of NSP and internal details of ASP solvers, such as cardinality and weight constraint propagators. The performance gain of CLINGO and wasp is empirically verified on instances from ASP literature. As an additional contribution, the performance of CLINGO and wasp is compared to other declarative frameworks, namely SAT and ILP;the best performance is obtained by CLINGO running the new ASP encoding.

关键词： answer set programming Knowledge representation and reasoning Nurse Scheduling

来源：评论

学校读者我要写书评

暂无评论

Generative Datalog and answer set programming - Extended Abstract 18th

Generative Datalog and Answer Set Programming - Extended Abs...

引用

18th European Conference on Logics in Artificial Intelligence (JELIA)

作者： Alviano, Mario Univ Calabria DEMACS Via Bucci 30-B I-87036 Arcavacata Di Rende CS Italy

ISBN: (纸本)9783031436185;9783031436192

Generative Datalog is an extension of Datalog that incorporates constructs for referencing parameterized probability distributions. This augmentation transforms the evaluation of a Generative Datalog program into a stochastic process, resulting in a declarative formalism suitable for modeling and analyzing other stochastic processes. This work provides an introduction to Generative Datalog through the lens of answer set programming (ASP), demonstrating how Generative Datalog can explain the output of ASP systems that include @-terms referencing probability distributions. From a theoretical point of view, extending the semantics of Generative Datalog to stable negation proved to be challenging due to the richness of ASP relative to Datalog in terms of linguistic constructs. On a more pragmatic side, the connection between the two formalisms lays the foundation for implementing Generative Datalog atop efficient ASP systems, making it a practical solution for real-world applications.

关键词： answer set programming Datalog probabilistic reasoning non-measurable sets stable model semantics

来源：评论

学校读者我要写书评

暂无评论

Exploiting answer set programming for Building explainable Recommendations 25th

Exploiting Answer Set Programming for Building explainable R...

引用

25th International Symposium on Methodologies for Intelligent Systems (ISMIS)

作者： Teppan, Erich Zanker, Markus Univ Klagenfurt Klagenfurt Austria Free Univ Bolzano Bolzano Italy

ISBN: (纸本)9783030594916;9783030594909

The capability of a recommendation system to justify its proposals becomes an ever more important aspect in light of recent legislation and skeptic users. answer set programming (ASP) is a logic programming paradigm aiming at expressing complex problems in a succinct and declarative manner. Due to its rich set of high level language constructs it turns out that ASP is also perfectly suitable for realizing knowledge and/or utility-based recommendation applications, since every aspect of such a utility-based recommendation capable of producing explanations can be specified within ASP. In this paper we give an introduction to the concepts of ASP and how they can be applied in the domain of recommender systems. Based on a small excerpt of a real life recommender database we exemplify how utility based recommendation engines can be implemented with just some few lines of code and show how meaningful explanations can be derived out of the box.

关键词： Recommender systems Explanations answer set programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Consistency Checking in Goal-Directed answer set programming

Dynamic Consistency Checking in Goal-Directed Answer Set Pro...

引用

30th International Conference on Logic programming

作者： Marple, Kyle Gupta, Gopal Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which only those constraints deemed relevant to the partial answer set are tested, allowing inconsistent knowledgebases to be successfully queried. However, the algorithm guarantees that, if a program has at least one consistent answer set, any partial answer set returned will be a subset of some consistent answer set.

关键词： dynamic consistency checking answer set programming goal-directed consistent query answering

来源：评论

学校读者我要写书评

暂无评论

Towards value-awareness in administrative processes: an approach based on constraint answer set programming 24

Towards value-awareness in administrative processes: an appr...

引用

39th Annual ACM Symposium on Applied Computing (SAC)

作者： Arias, Joaquin Moreno-Rebato, Mar Rodriguez-Garcia, Jose A. Ossowski, Sascha Univ Rey Juan Carlos CETINIA Madrid Spain

ISBN: (纸本)9798400702433

The proposed regulatory framework for Artificial Intelligence and the EU General Data Protection Regulation oblige automated reasoners to justify their conclusions in human-understandable terms. In addition, ethical and legal concerns must be provably addressed to ensure that the advice given by AI systems is aligned with human values. Value-aware systems tackle this challenge by explicitly representing and reasoning with norms and values applicable to a problem domain. For instance, in the context of a public administration such systems may provide support to decision-makers in the design and interpretation of administrative procedures and, ultimately, may enable the automation of (parts of) these administrative processes. However, this requires the capability to analyze as to how far a particular legal model is aligned with a certain value system. In this work, we take a step forward in this direction by analysing and formally representing two (political) strategies for school place allocation in educational institutions supported by public funds. The corresponding (legal) norms that specify this administrative process differently weigh human values such as equality, fairness, and non-segregation. We propose the use of s(LAW), a legal reasoner based on answer set programming that has proven capable of adequately modelling administrative processes in the presence of vague concepts and/or discretion, to model both strategies. We illustrate how s(LAW) simultaneously models different scenarios, and how automated reasoning with these scenarios can answer questions related to the value-alignment of the resulting models.

关键词： Value Awareness Engineering Goal-directed execution answer set programming Decision-making s(LAW)

来源：评论

学校读者我要写书评

暂无评论

Model Level Design Pattern Instance Detection using answer set programming 8

Model Level Design Pattern Instance Detection using Answer S...

引用

8th IEEE/ACM International Workshop on Modeling in Software Engineering (MiSE)

作者： Luitel, Gaurab Stephan, Matthew Inclezan, Daniela Miami Univ Dept Comp Sci & Software Engn Oxford OH 45056 USA

ISBN: (纸本)9781450341646

Software engineering is becoming increasingly model-centric. Engineers are using models more within projects and their models are growing in complexity. A challenge facing the modeling community is evaluation of these models. One technique for software evaluation is detecting instances of established "good" or "bad" solutions in a system, often termed design patterns or antipatterns, respectively. Most approaches require implemented code for detection. However, this precludes early-stage analysis, and the evaluation of purely or mostly model-centric systems. In this position paper, we introduce a detection technique that uses answer set programming to find occurrences of patterns within sets of structural and behavioral models. We represent the patterns as rules and the structural and behavioral system models as facts, requiring both model types since some patterns specify both. We provide an overview of our proposed approach, contrast existing work, and present discussion points on its impact on model evaluation and anticipated challenges.

关键词： model evaluation design patterns antipatterns model patterns model quality answer set programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：