咨询与建议

限定检索结果

文献类型

  • 511 篇 期刊文献
  • 352 篇 会议
  • 11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 826 篇 工学
    • 792 篇 计算机科学与技术...
    • 401 篇 软件工程
    • 59 篇 电气工程
    • 26 篇 信息与通信工程
    • 25 篇 控制科学与工程
    • 7 篇 机械工程
    • 6 篇 生物工程
    • 4 篇 生物医学工程(可授...
    • 3 篇 化学工程与技术
    • 2 篇 仪器科学与技术
    • 2 篇 航空宇航科学与技...
  • 409 篇 理学
    • 390 篇 数学
    • 11 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 5 篇 科学技术史(分学科...
    • 2 篇 物理学
    • 2 篇 地球物理学
    • 2 篇 系统科学
    • 1 篇 地理学
  • 27 篇 管理学
    • 23 篇 管理科学与工程(可...
    • 2 篇 公共管理
    • 2 篇 图书情报与档案管...
  • 14 篇 哲学
    • 8 篇 哲学
  • 10 篇 法学
    • 9 篇 法学
    • 1 篇 社会学
  • 7 篇 医学
    • 3 篇 基础医学(可授医学...
    • 2 篇 临床医学
  • 5 篇 教育学
    • 4 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 4 篇 农学
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 874 篇 answer set progr...
  • 78 篇 logic programmin...
  • 68 篇 knowledge repres...
  • 36 篇 knowledge repres...
  • 32 篇 nonmonotonic rea...
  • 28 篇 artificial intel...
  • 26 篇 equilibrium logi...
  • 25 篇 inductive logic ...
  • 23 篇 non-monotonic re...
  • 21 篇 stable models
  • 19 篇 stable model sem...
  • 17 篇 stream reasoning
  • 16 篇 aggregates
  • 16 篇 computational co...
  • 15 篇 strong equivalen...
  • 12 篇 theory
  • 11 篇 description logi...
  • 11 篇 forgetting
  • 11 篇 semantic web
  • 11 篇 machine learning

机构

  • 35 篇 univ potsdam pot...
  • 19 篇 univ calabria ar...
  • 17 篇 univ calabria de...
  • 15 篇 sabanci univ fac...
  • 14 篇 univ genoa dibri...
  • 14 篇 univ calabria de...
  • 12 篇 univ a coruna la...
  • 12 篇 univ genoa genoa
  • 11 篇 univ politecn ma...
  • 11 篇 texas tech univ ...
  • 11 篇 vienna univ tech...
  • 11 篇 vrije univ bruss...
  • 11 篇 new mexico state...
  • 10 篇 tu wien austria
  • 10 篇 univ calabria de...
  • 10 篇 vienna univ tech...
  • 10 篇 univ klagenfurt ...
  • 10 篇 univ texas austi...
  • 8 篇 macquarie univ d...
  • 8 篇 univ calabria co...

作者

  • 49 篇 schaub torsten
  • 44 篇 alviano mario
  • 44 篇 ricca francesco
  • 36 篇 dodaro carmine
  • 35 篇 cabalar pedro
  • 32 篇 eiter thomas
  • 29 篇 maratea marco
  • 28 篇 leone nicola
  • 28 篇 gebser martin
  • 27 篇 calimeri frances...
  • 24 篇 fandinno jorge
  • 23 篇 erdem esra
  • 22 篇 ianni giovambatt...
  • 20 篇 lifschitz vladim...
  • 20 篇 gupta gopal
  • 19 篇 zangari jessica
  • 19 篇 perri simona
  • 18 篇 balduccini marce...
  • 18 篇 lierler yuliya
  • 18 篇 faber wolfgang

语言

  • 849 篇 英文
  • 20 篇 其他
  • 2 篇 土耳其文
  • 2 篇 中文
  • 1 篇 斯洛伐克文
检索条件"主题词=Answer Set Programming"
874 条 记 录,以下是601-610 订阅
排序:
Functional ASP with Intensional sets: Application to Gelfond-Zhang Aggregates
收藏 引用
THEORY AND PRACTICE OF LOGIC programming 2018年 第3-4期18卷 390-405页
作者: Cabalar, Pedro Fadinno, Jorge Del Cerro, Luis Farinas Pearce, David Univ A Coruna Dept Comp Sci Corunna Spain Univ Toulouse CNRS IRIT Toulouse France Univ Politecn Madrid Madrid Spain
In this paper, we propose a variant of answer set programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, ... 详细信息
来源: 评论
OntoDLV: An ASP-based System for Enterprise Ontologies
收藏 引用
JOURNAL OF LOGIC AND COMPUTATION 2009年 第4期19卷 643-670页
作者: Ricca, Francesco Gallucci, Lorenzo Schindlauer, Roman Dell'Armi, Tina Grasso, Giovanni Leone, Nicola Univ Calabria Dept Math I-87036 Arcavacata Di Rende CS Italy Univ Calabria Exeura SRL I-87036 Arcavacata Di Rende CS Italy
Enterprise/Corporate ontologies are widely adopted to conceptualize business enterprise information. In this area, the semantic peculiarities of answer set programming (ASP), like the Closed World Assumption (CWA) and... 详细信息
来源: 评论
answer sets and qualitative optimization
收藏 引用
LOGIC JOURNAL OF THE IGPL 2006年 第3期14卷 413-433页
作者: Brewka, Gerhard Univ Leipzig Dept Comp Sci D-04109 Leipzig Germany
One of the major reasons for the success of answer set programming in recent years was the shift from a theorem proving to a constraint programming view: problems are represented such that stable models, respectively ... 详细信息
来源: 评论
Automatic Generation of Problems and Explanations for an Intelligent Algebra Tutor  20th
Automatic Generation of Problems and Explanations for an Int...
收藏 引用
20th International Conference on Artificial Intelligence in Education (AIED)
作者: O'Rourke, Eleanor Butler, Eric Tolentino, Armando Diaz Popovic, Zoran Northwestern Univ Evanston IL 60208 USA Univ Washington Seattle WA 98195 USA
Intelligent tutors that emulate one-on-one tutoring with a human have been shown to effectively support student learning, but these systems are often challenging to build. Most methods for implementing tutors focus on... 详细信息
来源: 评论
Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
收藏 引用
THEORY AND PRACTICE OF LOGIC programming 2013年 第4-5期13卷 831-846页
作者: Erdem, Esra Patoglu, Volkan Saribatur, Zeynep G. Schuller, Peter Uras, Tansel Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey Univ So Calif Dept Comp Sci Los Angeles CA 90089 USA
We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots bet... 详细信息
来源: 评论
Program completion in the input language of GRINGO
收藏 引用
THEORY AND PRACTICE OF LOGIC programming 2017年 第5-6期17卷 855-871页
作者: Harrison, Amelia Lifschitz, Vladimir Raju, Dhananjay Dept Comp Sci Austin TX 78712 USA
We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the "reverse engineering" process of generating a set of conditions that could serve as a specificatio... 详细信息
来源: 评论
Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
收藏 引用
ARTIFICIAL INTELLIGENCE 2024年 331卷
作者: Heyninck, Jesse Arieli, Ofer Bogaerts, Bart Open Univ Heerlen Netherlands Univ Cape Town Cape Town South Africa Tel Aviv Acad Coll Sch Comp Sci Tel Aviv Israel Vrije Univ Brussel Brussels Belgium
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonoto... 详细信息
来源: 评论
Possibilistic nested logic programs and strong equivalence
收藏 引用
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2015年 第Apr.期59卷 1-19页
作者: Nieves, Juan Carlos Lindgren, Helena Umea Univ Dept Comp Sci SE-90187 Umea Sweden
In this paper, the class of possibilistic nested logic programs is introduced. These possibilistic logic programs allow us to use nested expressions in the bodies and heads of their rules. By considering a possibilist... 详细信息
来源: 评论
Computing LPMLN using ASP and MLN solvers
收藏 引用
THEORY AND PRACTICE OF LOGIC programming 2017年 第5-6期17卷 942-960页
作者: Lee, Joohyung Talsania, Samidh Wang, Yi Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85281 USA
LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic ... 详细信息
来源: 评论
Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
收藏 引用
THEORY AND PRACTICE OF LOGIC programming 2020年 第5期20卷 799-814页
作者: Taupe, Richard Weinzierl, Antonius Friedrich, Gerhard Siemens AG Osterreich Graz Austria Alpen Adria Univ Klagenfurt Austria TU Wien Vienna Univ Technol Vienna Austria
Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers. We suggest a new approach that generalises learned nogoods for re-use to speed-... 详细信息
来源: 评论