咨询与建议

限定检索结果

文献类型

  • 882 篇 期刊文献
  • 588 篇 会议
  • 104 册 图书
  • 22 篇 学位论文

馆藏范围

  • 1,597 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,374 篇 工学
    • 1,339 篇 计算机科学与技术...
    • 1,201 篇 软件工程
    • 28 篇 控制科学与工程
    • 20 篇 电气工程
    • 17 篇 信息与通信工程
    • 15 篇 机械工程
    • 7 篇 建筑学
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 4 篇 生物医学工程(可授...
    • 3 篇 仪器科学与技术
    • 3 篇 农业工程
    • 3 篇 网络空间安全
  • 927 篇 理学
    • 900 篇 数学
    • 31 篇 系统科学
    • 14 篇 统计学(可授理学、...
    • 7 篇 生物学
    • 2 篇 物理学
  • 67 篇 管理学
    • 41 篇 管理科学与工程(可...
    • 26 篇 图书情报与档案管...
    • 22 篇 工商管理
  • 16 篇 教育学
    • 14 篇 教育学
  • 6 篇 医学
    • 5 篇 基础医学(可授医学...
    • 5 篇 临床医学
    • 4 篇 公共卫生与预防医...
    • 3 篇 药学(可授医学、理...
  • 3 篇 哲学
    • 2 篇 哲学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 3 篇 农学
    • 3 篇 作物学
  • 1 篇 法学
  • 1 篇 文学

主题

  • 274 篇 answer set progr...
  • 248 篇 logic programmin...
  • 70 篇 software enginee...
  • 67 篇 mathematical log...
  • 60 篇 logics and meani...
  • 59 篇 programming lang...
  • 45 篇 semantics
  • 41 篇 knowledge repres...
  • 34 篇 constraint logic...
  • 32 篇 constraint progr...
  • 30 篇 programming tech...
  • 27 篇 constraint theor...
  • 27 篇 prolog
  • 25 篇 answer-set progr...
  • 24 篇 artificial intel...
  • 23 篇 software enginee...
  • 22 篇 inductive logic ...
  • 21 篇 program transfor...
  • 20 篇 theory
  • 20 篇 non-monotonic re...

机构

  • 38 篇 univ potsdam pot...
  • 22 篇 tu wien austria
  • 18 篇 new mexico state...
  • 16 篇 imdea software i...
  • 15 篇 univ genoa dibri...
  • 15 篇 univ kentucky de...
  • 14 篇 univ a coruna la...
  • 14 篇 univ texas austi...
  • 13 篇 univ calabria ar...
  • 12 篇 univ texas dalla...
  • 11 篇 katholieke univ ...
  • 11 篇 katholieke univ ...
  • 11 篇 vienna univ tech...
  • 10 篇 katholieke univ ...
  • 10 篇 imperial coll lo...
  • 10 篇 vienna univ tech...
  • 9 篇 univ politecn ma...
  • 9 篇 univ genoa genoa
  • 9 篇 univ nebraska om...
  • 9 篇 sabanci univ fac...

作者

  • 47 篇 schaub torsten
  • 34 篇 dodaro carmine
  • 30 篇 eiter thomas
  • 30 篇 cabalar pedro
  • 30 篇 ricca francesco
  • 26 篇 lierler yuliya
  • 26 篇 fandinno jorge
  • 26 篇 gupta gopal
  • 23 篇 riguzzi fabrizio
  • 23 篇 maratea marco
  • 22 篇 alviano mario
  • 21 篇 woltran stefan
  • 21 篇 lifschitz vladim...
  • 19 篇 pontelli enrico
  • 18 篇 gebser martin
  • 17 篇 erdem esra
  • 13 篇 leone nicola
  • 13 篇 carro manuel
  • 13 篇 calimeri frances...
  • 13 篇 oetsch johannes

语言

  • 1,557 篇 英文
  • 26 篇 中文
  • 14 篇 其他
检索条件"任意字段=Theory and Practice of Logic Programming"
1597 条 记 录,以下是21-30 订阅
排序:
Context-Dependent Effects in Guarded Interaction Trees  34th
Context-Dependent Effects in Guarded Interaction Trees
收藏 引用
34th European Symposium on programming, ESOP 2025, which was held as part of the International Joint Conferences on theory and practice of Software, ETAPS 2025
作者: Stepanenko, Sergei Nardino, Emma Frumin, Dan Timany, Amin Birkedal, Lars Aarhus University Aarhus Denmark Univ Lyon ENS de Lyon UCBL CNRS Inria LIP UMR 5668 Lyon CEDEX 0769342 France University of Groningen Groningen Netherlands
Guarded Interaction Trees are a structure and a fully formalized framework for representing higher-order computations with higher-order effects in Coq. We present an extension of Guarded Interaction Trees to supp... 详细信息
来源: 评论
A Program logic for Concurrent Randomized Programs in the Oblivious Adversary Model  34th
A Program Logic for Concurrent Randomized Programs in the Ob...
收藏 引用
34th European Symposium on programming, ESOP 2025, which was held as part of the International Joint Conferences on theory and practice of Software, ETAPS 2025
作者: Fan, Weijie Liang, Hongjin Feng, Xinyu Jiang, Hanru State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing210023 China Beijing Institute of Mathematical Sciences and Applications Beijing Beijing101408 China
Concurrent randomized programs in the oblivious adversary model are extremely difficult for modular verification because the interaction between threads is very sensitive to the program structure and the exe... 详细信息
来源: 评论
On the Relationship between Dijkstra Monads and Higher-Order Fixpoint logic  34th
On the Relationship between Dijkstra Monads and Higher-Order...
收藏 引用
34th European Symposium on programming, ESOP 2025, which was held as part of the International Joint Conferences on theory and practice of Software, ETAPS 2025
作者: Yamada, Risa Kobayashi, Naoki Sakayori, Ken Sato, Ryosuke The University of Tokyo Tokyo Japan Tokyo University of Agriculture and Technology Tokyo Japan
We study the relationship between two approaches to higher-order program verification: a semi-automated method using Dijkstra monads and a fully automated method using a higher-order fixpoint logic called HFL(Z). Alth... 详细信息
来源: 评论
Split Decisions: Explicit Contexts for Substructural Languages  25
Split Decisions: Explicit Contexts for Substructural Languag...
收藏 引用
14th Conference on Certified Programs and Proofs
作者: Zackon, Daniel Sano, Chuta Momigliano, Alberto Pientka, Brigitte McGill Univ Montreal PQ Canada Univ Milan Milan Italy
A central challenge in mechanizing the meta-theory of substructural languages is modeling contexts. Although various ad hoc approaches to this problem exist, we lack a set of good practices and a simple infrastructure... 详细信息
来源: 评论
ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding
收藏 引用
theory and practice of logic programming 2025年
作者: Calimeri, Francesco Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Univ Calabria Arcavacata Di Rende Italy
DLV2 is an AI tool for knowledge representation and reasoning that supports answer set programming (ASP) - a logic-based declarative formalism, successfully used in both academic and industrial applications. Given a l... 详细信息
来源: 评论
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration  34th
Compositional Shape Analysis with Shared Abduction and Biabd...
收藏 引用
34th European Symposium on programming, ESOP 2025, which was held as part of the International Joint Conferences on theory and practice of Software, ETAPS 2025
作者: Sextl, Florian Rogalewicz, Adam Vojnar, Tomáš Zuleger, Florian Faculty of Informatics Institute of Logic and Computation TU Wien Vienna Austria Faculty of Information Technology Brno University of Technology Brno Czech Republic Faculty of Informatics Masaryk University Brno Czech Republic
Biabduction-based shape analysis is a compositional verification and analysis technique that can prove memory safety in the presence of complex, linked data structures. Despite its usefulness, several open proble... 详细信息
来源: 评论
In Praise of Impredicativity: A Contribution to the Formalization of Meta-programming
收藏 引用
theory and practice of logic programming 2020年 第1期20卷 99-146页
作者: Bry, Francois Ludwig Maximilian Univ Munich Inst Informat Munich Germany
Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming, and meta-programs, as they are call... 详细信息
来源: 评论
Introduction to the 30th International Conference on logic programming Special Issue
收藏 引用
theory and practice of logic programming 2014年 第4-5期14卷 401-414页
作者: Leuschel, Michael Schrijvers, Tom Univ Dusseldorf Dusseldorf Germany Univ Ghent B-9000 Ghent Belgium
The 30th edition of the International Conference of logic programming took place in Vienna in July 2014 at the Vienna Summer of logic - the largest scientific conference in the history of logic. Following the initiati...
来源: 评论
A Survey of the Proof-Theoretic Foundations of logic programming
收藏 引用
theory and practice of logic programming 2022年 第6期22卷 859-904页
作者: Miller, Dale Ecole Polytech Inria Saclay Palaiseau France Ecole Polytech LIX Palaiseau France
Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this article, we will survey the use of structural proof theory as an alternative foundation. Resea... 详细信息
来源: 评论
logic programming with default, weak and strict negations
收藏 引用
theory and practice of logic programming 2006年 第0期6卷 737-749页
作者: Yamasaki, Susumu Okayama Univ Grad Sch Nat Sci & Technol Dept Comp Sci Okayama 7008530 Japan
This paper looks at logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is cons... 详细信息
来源: 评论