咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献

馆藏范围

  • 13 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 13 篇 理学
    • 13 篇 数学
  • 13 篇 工学
    • 13 篇 计算机科学与技术...
    • 13 篇 软件工程

主题

  • 13 篇 logic programmin...
  • 8 篇 knowledge repres...
  • 3 篇 theory
  • 2 篇 specification
  • 2 篇 design
  • 2 篇 security
  • 2 篇 databases and se...
  • 2 篇 analysis and imp...
  • 2 篇 analysis and ver...
  • 1 篇 technical notes ...
  • 1 篇 inductive logic ...
  • 1 篇 answer set progr...

机构

  • 2 篇 univ potsdam pot...
  • 2 篇 tu wien austria
  • 1 篇 univ politecn ma...
  • 1 篇 univ southern ca...
  • 1 篇 katholieke univ ...
  • 1 篇 univ a coruna la...
  • 1 篇 ted univ ankara ...
  • 1 篇 univ calabria ge...
  • 1 篇 univ miami oxfor...
  • 1 篇 univ calabria ar...
  • 1 篇 univ genoa genoa
  • 1 篇 univ nebraska om...
  • 1 篇 univ sydney gleb...
  • 1 篇 univ kentucky le...
  • 1 篇 univ montpellier...
  • 1 篇 univ toulouse cn...
  • 1 篇 surgiq srl genoa
  • 1 篇 imdea software i...
  • 1 篇 australian natl ...
  • 1 篇 univ calabria de...

作者

  • 2 篇 fandinno jorge
  • 2 篇 maratea marco
  • 1 篇 kimmig a. n. g. ...
  • 1 篇 raghothaman muku...
  • 1 篇 subotic pavle
  • 1 篇 baumgartner pete...
  • 1 篇 schaub torsten
  • 1 篇 delivorias stath...
  • 1 篇 hermenegildo man...
  • 1 篇 woltran stefan
  • 1 篇 lifschitz vladim...
  • 1 篇 jurjo-rivas dani...
  • 1 篇 morak michael
  • 1 篇 sabuncu orkunt
  • 1 篇 kiesel r. a. f. ...
  • 1 篇 porro ivan
  • 1 篇 zangari jessica
  • 1 篇 calimeri frances...
  • 1 篇 galata giuseppe
  • 1 篇 totis p. i. e. t...

语言

  • 13 篇 英文
检索条件"主题词=logic programming methodology and applications"
13 条 记 录,以下是1-10 订阅
排序:
Provenance Guided Rollback Suggestions
收藏 引用
THEORY AND PRACTICE OF logic programming 2025年
作者: Zhao, David Subotic, Pavle Raghothaman, Mukund Scholz, Bernhard Univ Sydney Glebe NSW Australia Microsoft Redmond WA USA Univ Southern Calif Los Angeles CA USA
Advances in incremental Datalog evaluation strategies have made Datalog popular among use cases with constantly evolving inputs such as static analysis in continuous integration and deployment pipelines. As a result, ... 详细信息
来源: 评论
Locally Tight Programs
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第5期24卷 942-972页
作者: Fandinno, Jorge Lifschitz, Vladimir Temple, Nathan Univ Nebraska Omaha NE 68182 USA Univ Texas Austin Austin TX 78712 USA
Program completion is a translation from the language of logic programs into the language of first-order theories. Its original definition has been extended to programs that include integer arithmetic, accept input, a... 详细信息
来源: 评论
CON-FOLD Explainable Machine Learning with Confidence
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第4期24卷 663-681页
作者: Mcginness, Lachlan Baumgartner, Peter Australian Natl Univ Sch Comp Sci Canberra Australia CSIRO Data61 Canberra Australia
FOLD-RM is an explainable machine learning classification algorithm that uses training data to create a set of classification rules. In this paper, we introduce CON-FOLD which extends FOLD-RM in several ways. CON-FOLD... 详细信息
来源: 评论
Clingraph: A System for ASP-based Visualization
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第3期24卷 533-559页
作者: Hahn, Susana Sabuncu, Orkunt Schaub, Torsten Stolzmann, Tobias Univ Potsdam Potsdam Germany Germany Potassco Solut Potsdam Germany TED Univ Ankara Turkiye Turkey Potassco Solut Potsdam Germany
We present the Answer Set programming (ASP)-based visualization tool clingraph, which aims at visualizing various concepts of ASP by means of ASP itself. This idea traces back to the aspviz tool and clingraph redevelo... 详细信息
来源: 评论
Preface to the Special Issue on the 2022 Conference on logic programming and Nonmonotonic Reasoning
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第3期24卷 422-424页
作者: Gottlob, Georg Inclezan, Daniela Maratea, Marco Univ Calabria Arcavacata Di Rende Italy Univ Miami Oxford OH USA
来源: 评论
Quantifying over Optimum Answer Sets
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第4期24卷 716-736页
作者: Mazzotta, Giuseppe Ricca, Francesco Truszczynski, Mirek Univ Calabria Arcavacata De Rende Italy Univ Kentucky Lexington KY USA
Answer Set programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) lacks a method for encoding in an elega... 详细信息
来源: 评论
Abstract Environment Trimming
收藏 引用
THEORY AND PRACTICE OF logic programming 2024年 第4期24卷 863-884页
作者: Jurjo-rivas, Daniel Morales, Jose F. Lopez-garcia, Pedro Hermenegildo, Manuel, V Univ Politecn Madrid UPM IMDEA Software Inst Madrid Spain IMDEA Software Inst Spanish Council Sci Res Madrid Spain
Variable sharing is a fundamental property in the static analysis of logic programs, since it is instrumental for ensuring correctness and increasing precision while inferring many useful program properties. Such prop... 详细信息
来源: 评论
Operating Room (Re)Scheduling with Bed Management via ASP
收藏 引用
THEORY AND PRACTICE OF logic programming 2022年 第2期22卷 229-253页
作者: Dodaro, Carmine Galata, Giuseppe Khan, Muhammad Kamran Maratea, Marco Porro, Ivan Univ Calabria Genoa Italy SurgiQ Srl Genoa Italy Univ Genoa Genoa Italy
The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms (ORs), taking into account different specialties, lengths, and priority scores of each planned surgery, OR session durat... 详细信息
来源: 评论
Efficient Knowledge Compilation Beyond Weighted Model Counting
收藏 引用
THEORY AND PRACTICE OF logic programming 2022年 第4期22卷 505-522页
作者: KIESEL, R. A. F. A. E. L. TOTIS, P. I. E. T. R. O. KIMMIG, A. N. G. E. L. I. K. A. TU Wien Vienna Austria Katholieke Univ Leuven Leuven Belgium
Quantitative extensions of logic programming often require the solution of so called second level inference tasks, that is, problems that involve a third operation, such as maximization or normalization, on top of add... 详细信息
来源: 评论
Characterizing Boundedness in Chase Variants
收藏 引用
THEORY AND PRACTICE OF logic programming 2021年 第1期21卷 51-79页
作者: Delivorias, Stathis Leclere, Michel Mugnier, Marie-Laure Ulliana, Federico Univ Montpellier LIRMM CNRS INRIA Montpellier France
Existential rules are a positive fragment of first-order logic that generalizes function-free Horn rules by allowing existentially quantified variables in rule heads. This family of languages has recently attracted si... 详细信息
来源: 评论