Semantics and complexity of recursive aggregates in answer set programming-Reference-Cited by-同舟云学术

Semantics and complexity of recursive aggregates in answer set programming

Published:2011-01 Issue:1 Volume:175 Page:278-298
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Faber Wolfgang,Pfeifer Gerald,Leone Nicola

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference59 articles.

1. Recursive aggregates in disjunctive logic programs: Semantics and complexity;Faber,2004

2. F. Calimeri, W. Faber, N. Leone, S. Perri, Declarative and computational properties of logic programs with aggregates, in: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), 2005, pp. 406–411.

3. J. McCarthy, Programs with common sense, in: Proceedings of the Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, 1959, pp. 75–91.

4. Some philosophical problems from the standpoint of artificial intelligence;McCarthy,1969

5. A framework for representing knowledge;Minsky,1975

Cited by 132 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Operating Room Scheduling via Answer Set Programming: improved encoding and test on real data;Journal of Logic and Computation;2024-07-29

2. Embedding justification theory in approximation fixpoint theory;Artificial Intelligence;2024-06

3. aspmc: New frontiers of algebraic answer set counting;Artificial Intelligence;2024-05

4. CNL2ASP: Converting Controlled Natural Language Sentences into ASP;Theory and Practice of Logic Programming;2023-12-20

5. Forming We-intentions under breakdown situations in human-robot interactions;Computer Methods and Programs in Biomedicine;2023-12