咨询与建议

限定检索结果

文献类型

  • 668 篇 会议
  • 32 篇 期刊文献
  • 19 册 图书

馆藏范围

  • 718 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 648 篇 工学
    • 645 篇 计算机科学与技术...
    • 356 篇 软件工程
    • 28 篇 控制科学与工程
    • 22 篇 电气工程
    • 18 篇 信息与通信工程
    • 3 篇 材料科学与工程(可...
    • 3 篇 建筑学
    • 3 篇 生物工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 力学(可授工学、理...
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
    • 1 篇 交通运输工程
    • 1 篇 核科学与技术
    • 1 篇 农业工程
  • 129 篇 理学
    • 120 篇 数学
    • 5 篇 物理学
    • 5 篇 生物学
    • 5 篇 系统科学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
  • 33 篇 管理学
    • 23 篇 图书情报与档案管...
    • 13 篇 管理科学与工程(可...
    • 7 篇 工商管理
  • 5 篇 法学
    • 4 篇 社会学
    • 1 篇 法学
  • 3 篇 医学
    • 3 篇 临床医学
    • 2 篇 基础医学(可授医学...
    • 2 篇 药学(可授医学、理...
  • 2 篇 教育学
    • 2 篇 教育学
  • 1 篇 农学

主题

  • 247 篇 logic programmin...
  • 46 篇 answer set progr...
  • 44 篇 semantics
  • 22 篇 computer circuit...
  • 22 篇 artificial intel...
  • 21 篇 knowledge repres...
  • 20 篇 formal logic
  • 18 篇 nonmonotonic rea...
  • 12 篇 calculations
  • 11 篇 mathematical log...
  • 11 篇 logics and meani...
  • 9 篇 constraint progr...
  • 8 篇 answer-set progr...
  • 8 篇 atoms
  • 8 篇 inductive logic ...
  • 8 篇 ontology
  • 7 篇 knowledge repres...
  • 7 篇 programming tech...
  • 6 篇 software enginee...
  • 6 篇 data description

机构

  • 21 篇 vienna univ tech...
  • 11 篇 univ potsdam pot...
  • 10 篇 univ kentucky de...
  • 8 篇 univ bath dept c...
  • 8 篇 univ potsdam ins...
  • 7 篇 univ texas dept ...
  • 6 篇 new mexico state...
  • 6 篇 tu wien austria
  • 6 篇 inria rennes ren...
  • 6 篇 university of po...
  • 5 篇 univ potsdam ins...
  • 5 篇 univ a coruna la...
  • 5 篇 simon fraser uni...
  • 5 篇 univ genoa dibri...
  • 5 篇 univ calabria ar...
  • 5 篇 new mexico state...
  • 5 篇 univ calabria de...
  • 5 篇 univ alberta dep...
  • 4 篇 vienna universit...
  • 4 篇 university of ca...

作者

  • 35 篇 schaub torsten
  • 25 篇 gebser martin
  • 23 篇 ricca francesco
  • 19 篇 tompits hans
  • 18 篇 eiter thomas
  • 17 篇 woltran stefan
  • 16 篇 leone nicola
  • 14 篇 alviano mario
  • 12 篇 faber wolfgang
  • 12 篇 cabalar pedro
  • 11 篇 brain martin
  • 11 篇 de vos marina
  • 10 篇 calimeri frances...
  • 10 篇 fink michael
  • 10 篇 inoue katsumi
  • 9 篇 ianni giovambatt...
  • 9 篇 son tran cao
  • 8 篇 giordano laura
  • 8 篇 eiter t
  • 8 篇 lifschitz vladim...

语言

  • 713 篇 英文
  • 4 篇 中文
  • 2 篇 其他
检索条件"任意字段=7th International Conference on Logic Programming and Nonmonotonic Reasoning"
719 条 记 录,以下是631-640 订阅
排序:
logical foundations of (e)RDF(S): Complexity and reasoning
收藏 引用
6th international Semantic Web conference/2nd Asian Semantic Web conference (ISWC 2007/ASWC 2007)
作者: de Bruijn, Jos Heymans, Stijn Faculty of Computer Science Free University of Bozen-Bolzano Italy Digital Enterprise Research Institute (DERI) University of Innsbruck Austria
An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logic... 详细信息
来源: 评论
nonmonotonic reasoning with well founded semantics
Proceedings of the International Conference on Logic Program...
收藏 引用
Proceedings of the international conference on logic programming 1991年 475-475页
作者: Pereira, Luis Moniz Aparicio, Joaquim Nunes Alferes, Jose Julio
来源: 评论
Extending the Grounded Semantics by logic programming Semantics
Extending the Grounded Semantics by Logic Programming Semant...
收藏 引用
14th international conference of the Catalan-Association-for-Artificial-Intelligence (CCIA)
作者: Carlos Nieves, Juan Osorio, Mauricio Cortes, Ulises Univ Politecn Cataluna Software Dept LSI C Jordi Girona 1-3 E-08034 Barcelona Spain Fundac Univ Amer Puebla Mexico
We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of... 详细信息
来源: 评论
Focused Labeled Proof Systems for Modal logic  1
收藏 引用
20th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)
作者: Miller, Dale Volpe, Marco Ecole Polytech Inria F-75230 Paris France Ecole Polytech LIX F-75230 Paris France
Focused proofs are sequent calculus proofs that group inference rules into alternating positive and negative phases. these phases can then be used to define macro-level inference rules Gentzen's original and tiny ... 详细信息
来源: 评论
On the Computational Complexity of Spatial logics with Connectedness Constraints
收藏 引用
15th international conference on logic for programming Artificial Intelligence and reasoning
作者: Kontchakov, R. Pratt-Hartmann, I. Wolter, F. Zakharyaschev, M. Univ London Birkbeck Coll Sch Comp Sci London WC1E 7HX England Univ Manchester Dept Comp Sci Manchester Lancs England Univ Liverpool Dept Comp Sci Liverpool Merseyside England
We investigate the computational complexity of spatial logics extended with the means to represent topological connectedness and restrict the number of connected components. In particular, we show that the connectedne... 详细信息
来源: 评论
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and threshold Formulae
A Quasipolynomial Cut-Elimination Procedure in Deep Inferenc...
收藏 引用
16th international conference on logic for programming, Artificial Intelligence and reasoning (LPAR)
作者: Bruscoli, Paola Guglielmi, Alessio Gundersen, Tom Parigot, Michel Univ Bath Bath BA2 7AY Avon England Univ Paris CNRS Lab PPS Paris France
Jerabek showed in 2008 that cuts in propositional-logic deep-inference proofs can be eliminated in quasipolynomial time. the proof is an indirect one relying on a result of Atserias, Galesi and Pudlak about monotone s... 详细信息
来源: 评论
Synthesizing Strongly Equivalent logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order logic  1
收藏 引用
12th international Joint conference on Automated reasoning (IJCAR)
作者: Heuer, Jan Wernhard, Christoph Univ Potsdam Potsdam Germany
We show a projective Beth definability theorem for logic programs under the stable model semantics: For given programs P and Q and vocabulary V (set of predicates) the existence of a program R in V such that P. R and ... 详细信息
来源: 评论
Proceedings of the 1st Workshop on Natural Language Processing and Automated reasoning (NLPAR) 2013
收藏 引用
CEUR Workshop Proceedings 2013年 1044卷 i页
作者: Baral, Chitta Schüller, Peter Arizona State University United States Sabanci University Turkey
来源: 评论
Constructive techniques for meta- and model-level reasoning
Constructive techniques for meta- and model-level reasoning
收藏 引用
10th international conference on Model Driven Engineering Languages and Systems
作者: Jackson, Ethan K. Sztipanovits, Janos Vanderbilt Univ Inst Software Integrated Syst 221 Kirkland Hall Nashville TN 37235 USA
the structural semantics of UML-based metamodeling were recently explored[l], providing a characterization of the models adhering to a metamodel. In particular, metamodels can be converted to a set of constraints expr... 详细信息
来源: 评论
A Formal Framework for Compositional Verification of Organic Computing Systems
A Formal Framework for Compositional Verification of Organic...
收藏 引用
7th international conference on Autonomic and Trusted Computing
作者: Nafz, Florian Seebach, Hella Steghoefer, Jan-Philipp Baeumler, Simon Reif, Wolfgang Univ Augsburg Dept Software Engn & Programming Languages D-86135 Augsburg Germany
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall ve... 详细信息
来源: 评论