Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             780 results found
no title author magazine year volume issue page(s) type
1 A branch and prune algorithm for the computation of generalized aspects of parallel robots Caro, S.
2014
182-183 C p. 34-50
17 p.
article
2 Abstraction from demonstration for efficient reinforcement learning in high-dimensional domains Cobo, Luis C.
2014
182-183 C p. 103-128
26 p.
article
3 Achieving fully proportional representation: Approximability results Skowron, Piotr
2015
182-183 C p. 67-103
37 p.
article
4 A complete solution to the Maximum Density Still Life Problem Chu, Geoffrey
2012
182-183 C p. 1-16
16 p.
article
5 A computational framework for conceptual blending Eppe, Manfred
2018
182-183 C p. 105-129
article
6 A concept drift-tolerant case-base editing technique Lu, Ning
2016
182-183 C p. 108-133
26 p.
article
7 A cooperative game-theoretic approach to the social ridesharing problem Bistaffa, Filippo
2017
182-183 C p. 86-117
32 p.
article
8 Action-model acquisition for planning via transfer learning Zhuo, Hankz Hankui
2014
182-183 C p. 80-103
24 p.
article
9 Adapting a kidney exchange algorithm to align with human values Freedman, Rachel

182-183 C p.
article
10 A deep learning framework for Hybrid Heterogeneous Transfer Learning Zhou, Joey Tianyi
2019
182-183 C p. 310-328
article
11 A defeasible reasoning model of inductive concept learning from examples and communication Ontañón, Santiago
2012
182-183 C p. 129-148
20 p.
article
12 Advanced SMT techniques for weighted model integration Morettin, Paolo
2019
182-183 C p. 1-27
article
13 Adversarial patrolling with spatially uncertain alarm signals Basilico, Nicola
2017
182-183 C p. 220-257
38 p.
article
14 A dynamic epistemic framework for reasoning about conformant probabilistic plans Li, Yanjun
2019
182-183 C p. 54-84
article
15 Affect control processes: Intelligent affective interaction using a partially observable Markov decision process Hoey, Jesse
2016
182-183 C p. 134-172
39 p.
article
16 A flexible ILP formulation for hierarchical clustering Gilpin, Sean
2017
182-183 C p. 95-109
15 p.
article
17 A formalization of programs in first-order logic with a discrete linear order Lin, Fangzhen
2016
182-183 C p. 1-25
25 p.
article
18 A general account of argumentation with preferences Modgil, Sanjay
2013
182-183 C p. 361-397
37 p.
article
19 A general framework for sound assumption-based argumentation dialogues Fan, Xiuyi
2014
182-183 C p. 20-54
35 p.
article
20 A generalised framework for dispute derivations in assumption-based argumentation Toni, Francesca
2013
182-183 C p. 1-43
43 p.
article
21 A general model and thresholds for random constraint satisfaction problems Fan, Yun
2012
182-183 C p. 1-17
17 p.
article
22 A general notion of equivalence for abstract argumentation Baumann, Ringo
2019
182-183 C p. 379-410
article
23 A general semi-structured formalism for computational argumentation: Definition, properties, and examples of application Baroni, Pietro
2018
182-183 C p. 158-207
article
24 A generic approach to planning in the presence of incomplete information: Theory and implementation To, Son Thanh
2015
182-183 C p. 1-51
51 p.
article
25 Agent planning programs De Giacomo, Giuseppe
2016
182-183 C p. 64-106
43 p.
article
26 A hybrid exact algorithm for complete set partitioning Michalak, Tomasz
2016
182-183 C p. 14-50
37 p.
article
27 Algorithm runtime prediction: Methods & evaluation Hutter, Frank
2014
182-183 C p. 79-111
33 p.
article
28 Algorithms and everyday life Davis, Ernest
2016
182-183 C p. 1-6
6 p.
article
29 Algorithms for computing minimal equivalent subformulas Belov, Anton
2014
182-183 C p. 309-326
18 p.
article
30 Algorithms for computing strategies in two-player simultaneous move games Bošanský, Branislav
2016
182-183 C p. 1-40
40 p.
article
31 Algorithms for decision problems in argument systems under preferred semantics Nofal, Samer
2014
182-183 C p. 23-51
29 p.
article
32 Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes Rigas, Emmanouil S.

182-183 C p. 248-278
article
33 Algorithms for estimating the partition function of restricted Boltzmann machines Krause, Oswin

182-183 C p.
article
34 Algorithms for strategyproof classification Meir, Reshef
2012
182-183 C p. 123-156
34 p.
article
35 A logic for reasoning about ambiguity Halpern, Joseph Y.
2014
182-183 C p. 1-10
10 p.
article
36 Alors: An algorithm recommender system Mısır, Mustafa
2017
182-183 C p. 291-314
24 p.
article
37 A min-flow algorithm for Minimal Critical Set detection in Resource Constrained Project Scheduling Lombardi, Michele
2012
182-183 C p. 58-67
10 p.
article
38 A model for temporal references and its application in a question answering program C. Bruce, Bertram
1972
182-183 C p. 1-25
25 p.
article
39 A model of language learning with semantics and meaning-preserving corrections Angluin, Dana
2017
182-183 C p. 23-51
29 p.
article
40 Analogy between concepts Barbot, N.
2019
182-183 C p. 487-539
article
41 Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory Strass, Hannes
2015
182-183 C p. 34-74
41 p.
article
42 An analysis on recombination in multi-objective evolutionary optimization Qian, Chao
2013
182-183 C p. 99-119
21 p.
article
43 An approach for combining ethical principles with public opinion to guide public policy Awad, Edmond

182-183 C p.
article
44 An approach to decision making based on dynamic argumentation systems Ferretti, Edgardo
2017
182-183 C p. 107-131
25 p.
article
45 An axiomatic analysis of structured argumentation with priorities Dung, Phan Minh
2016
182-183 C p. 107-150
44 p.
article
46 An efficient and versatile approach to trust and reputation using hierarchical Bayesian modelling Teacy, W.T. Luke
2012
182-183 C p. 149-185
37 p.
article
47 An epistemic logic of blameworthiness Naumov, Pavel

182-183 C p.
article
48 An event-based distributed diagnosis framework using structural model decomposition Bregon, Anibal
2014
182-183 C p. 1-35
35 p.
article
49 A new probabilistic constraint logic programming language based on a generalised distribution semantics Michels, Steffen
2015
182-183 C p. 1-44
44 p.
article
50 A new semantics for overriding in description logics Bonatti, P.A.
2015
182-183 C p. 1-48
48 p.
article
51 An extension of metric temporal planning with application to AC voltage control Piacentini, Chiara
2015
182-183 C p. 210-245
36 p.
article
52 An initial study of time complexity in infinite-domain constraint satisfaction Jonsson, Peter
2017
182-183 C p. 115-133
19 p.
article
53 A non-monotonic Description Logic for reasoning about typicality Giordano, L.
2013
182-183 C p. 165-202
38 p.
article
54 A note on linear resolution strategies in consequence-finding Minicozzi, Eliana
1972
182-183 C p. 175-180
6 p.
article
55 A note on the complexity of the causal ordering problem Gonçalves, Bernardo
2016
182-183 C p. 154-165
12 p.
article
56 An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty Cimatti, Alessandro
2015
182-183 C p. 1-27
27 p.
article
57 Anticipatory action selection for human–robot table tennis Wang, Zhikun
2017
182-183 C p. 399-414
16 p.
article
58 An unsupervised training method for non-intrusive appliance load monitoring Parson, Oliver
2014
182-183 C p. 1-19
19 p.
article
59 Anytime coalition structure generation in multi-agent systems with positive or negative externalities Rahwan, Talal
2012
182-183 C p. 95-122
28 p.
article
60 A parametric propagator for pairs of Sum constraints with a discrete convexity property Monette, Jean-Noël
2016
182-183 C p. 170-190
21 p.
article
61 Applicability conditions for plans with loops: Computability results and algorithms Srivastava, Siddharth
2012
182-183 C p. 1-19
19 p.
article
62 Approximate verification of strategic abilities under imperfect information Jamroga, Wojciech
2019
182-183 C p.
article
63 Approximating operators and semantics for abstract dialectical frameworks Strass, Hannes
2013
182-183 C p. 39-70
32 p.
article
64 Approximating optimal social choice under metric preferences Anshelevich, Elliot
2018
182-183 C p. 27-51
article
65 Approximation quality of the hypervolume indicator Bringmann, Karl
2013
182-183 C p. 265-290
26 p.
article
66 A program for timetable compilation by a look-ahead method Cherniavsky, A.L
1972
182-183 C p. 61-76
16 p.
article
67 A progression semantics for first-order logic programs Zhou, Yi
2017
182-183 C p. 58-79
22 p.
article
68 A qualitative spatial representation of string loops as holes Cabalar, Pedro
2016
182-183 C p. 1-10
10 p.
article
69 A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing Jain, Shweta
2018
182-183 C p. 44-63
20 p.
article
70 Arbitrary arrow update logic van Ditmarsch, Hans
2017
182-183 C p. 80-106
27 p.
article
71 A reconstruction of multipreference closure Giordano, Laura

182-183 C p.
article
72 Arguing about informant credibility in open multi-agent systems Gottifredi, Sebastian
2018
182-183 C p. 91-109
article
73 Argument graphs and assumption-based argumentation Craven, Robert
2016
182-183 C p. 1-59
59 p.
article
74 Artificial cognition for social human–robot interaction: An implementation Lemaignan, Séverin
2017
182-183 C p. 45-69
25 p.
article
75 Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem Corus, Dogan
2019
182-183 C p. 180-196
article
76 Artificial Intelligence requires more than deep learning — but what, exactly? Wooldridge, Michael

182-183 C p.
article
77 Artificial systems with moral capacities? A research design and its implementation in a geriatric care system Misselhorn, Catrin

182-183 C p.
article
78 A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation Zhou, Yuren
2019
182-183 C p. 105-129
article
79 ASlib: A benchmark library for algorithm selection Bischl, Bernd
2016
182-183 C p. 41-58
18 p.
article
80 Asynchronous knowledge with hidden actions in the situation calculus Kelly, Ryan F.
2015
182-183 C p. 1-35
35 p.
article
81 A synthesis of automated planning and reinforcement learning for efficient, robust decision-making Leonetti, Matteo
2016
182-183 C p. 103-130
28 p.
article
82 A technical survey on statistical modelling and design methods for crowdsourcing quality control Jin, Yuan

182-183 C p.
article
83 Attachment centrality: Measure for connectivity in networks Skibski, Oskar
2019
182-183 C p. 151-179
article
84 Auction optimization using regression trees and linear models as integer programs Verwer, Sicco
2017
182-183 C p. 368-395
28 p.
article
85 Augmented transition networks as psychological models of sentence comprehension Kaplan, Ronald M
1972
182-183 C p. 77-100
24 p.
article
86 Augmenting tractable fragments of abstract argumentation Dvořák, Wolfgang
2012
182-183 C p. 157-173
17 p.
article
87 A unified framework of active transfer learning for cross-system recommendation Zhao, Lili
2017
182-183 C p. 38-55
18 p.
article
88 Author index 1972
182-183 C p. 292-
1 p.
article
89 Autoepistemic answer set programming Cabalar, Pedro

182-183 C p.
article
90 Autoepistemic equilibrium logic and epistemic specifications Iraz Su, Ezgi

182-183 C p.
article
91 Automata for infinite argumentation structures Baroni, Pietro
2013
182-183 C p. 104-150
47 p.
article
92 Automated aerial suspended cargo delivery through reinforcement learning Faust, Aleksandra
2017
182-183 C p. 381-398
18 p.
article
93 Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited Larson, C.E.
2016
182-183 C p. 17-38
22 p.
article
94 Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games Čermák, Jiří

182-183 C p.
article
95 Automated temporal equilibrium analysis: Verification and synthesis of multi-player games Gutierrez, Julian

182-183 C p.
article
96 Automated verification of state sequence invariants in general game playing Haufe, Sebastian
2012
182-183 C p. 1-30
30 p.
article
97 Automatically improving constraint models in Savile Row Nightingale, Peter
2017
182-183 C p. 35-61
27 p.
article
98 Automatic behavior composition synthesis De Giacomo, Giuseppe
2013
182-183 C p. 106-142
37 p.
article
99 Automatic construction of optimal static sequential portfolios for AI planning and beyond Núñez, Sergio
2015
182-183 C p. 75-101
27 p.
article
100 Automatic construction of parallel portfolios via algorithm configuration Lindauer, Marius
2017
182-183 C p. 272-290
19 p.
article
101 Automatic generation of sentimental texts via mixture adversarial networks Wang, K.
2019
182-183 C p. 540-558
article
102 Autonomous agents modelling other agents: A comprehensive survey and open problems Albrecht, Stefano V.
2018
182-183 C p. 66-95
article
103 BabelNet: The automatic construction, evaluation and application of a wide-coverage multilingual semantic network Navigli, Roberto
2012
182-183 C p. 217-250
34 p.
article
104 Backdoors to planning Kronegger, Martin
2019
182-183 C p. 49-75
article
105 Backdoors to tractable answer set programming Fichte, Johannes Klaus
2015
182-183 C p. 64-103
40 p.
article
106 Bagging and Boosting statistical machine translation systems Xiao, Tong
2013
182-183 C p. 496-527
32 p.
article
107 Batch repair actions for automated troubleshooting Shinitzky, Hilla

182-183 C p.
article
108 Belief and truth in hypothesised behaviours Albrecht, Stefano V.
2016
182-183 C p. 63-94
32 p.
article
109 Belief base contraction by belief accrual Deagustini, Cristhian A.D.
2019
182-183 C p. 78-103
article
110 Belief functions on distributive lattices Zhou, Chunlai
2013
182-183 C p. 1-31
31 p.
article
111 Belief revision and projection in the epistemic situation calculus Schwering, Christoph
2017
182-183 C p. 62-97
36 p.
article
112 Belief revision in Horn theories Delgrande, James P.
2015
182-183 C p. 1-22
22 p.
article
113 Belief revision, minimal change and relaxation: A general framework based on satisfaction systems, and applications to description logics Aiguier, Marc
2018
182-183 C p. 160-180
article
114 Better redistribution with inefficient allocation in multi-unit auctions Guo, Mingyu
2014
182-183 C p. 287-308
22 p.
article
115 Bi-goal evolution for many-objective optimization problems Li, Miqing
2015
182-183 C p. 45-65
21 p.
article
116 Boolean algebras of conditionals, probability and logic Flaminio, Tommaso

182-183 C p.
article
117 Bounded model checking of strategy ability with perfect recall Huang, Xiaowei
2015
182-183 C p. 182-200
19 p.
article
118 Bounded situation calculus action theories De Giacomo, Giuseppe
2016
182-183 C p. 172-203
32 p.
article
119 Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems Cooper, Martin C.
2016
182-183 C p. 196-218
23 p.
article
120 Building knowledge maps of Web graphs Fionda, Valeria
2016
182-183 C p. 143-167
25 p.
article
121 Causal identifiability via Chain Event Graphs Thwaites, Peter
2013
182-183 C p. 291-315
25 p.
article
122 CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability Luo, Chuan
2017
182-183 C p. 26-44
19 p.
article
123 Certain answers as objects and knowledge Libkin, Leonid
2016
182-183 C p. 1-19
19 p.
article
124 Characteristic function games with restricted agent interactions: Core-stability and coalition structures Chalkiadakis, Georgios
2016
182-183 C p. 76-113
38 p.
article
125 Characteristics of multiple viewpoints in abstract argumentation Dunne, Paul E.
2015
182-183 C p. 153-178
26 p.
article
126 Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations Gottifredi, Sebastian

182-183 C p. 336-368
article
127 Characterizing causal action theories and their implementations in answer set programming Zhang, Haodi
2017
182-183 C p. 1-8
8 p.
article
128 Classical logic, argument and dialectic D'Agostino, M.

182-183 C p. 15-51
article
129 Clause vivification by unit propagation in CDCL SAT solvers Li, Chu-Min

182-183 C p.
article
130 Clustering ensemble based on sample's stability Li, Feijiang
2019
182-183 C p. 37-55
article
131 Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value Greco, Gianluigi

182-183 C p.
article
132 Coalition structure generation: A survey Rahwan, Talal
2015
182-183 C p. 139-174
36 p.
article
133 Coevolutionary systems and PageRank Chong, S.Y.
2019
182-183 C p.
article
134 Combining experts' causal judgments Alrajeh, Dalal

182-183 C p.
article
135 Combining gaze and AI planning for online human intention recognition Singh, Ronal

182-183 C p.
article
136 Commonsense reasoning about containers using radically incomplete information Davis, Ernest
2017
182-183 C p. 46-84
39 p.
article
137 Communicating open systems dʼInverno, Mark
2012
182-183 C p. 38-94
57 p.
article
138 Compact and efficient encodings for planning in factored state and action spaces with learned Binarized Neural Network transition models Say, Buser

182-183 C p.
article
139 Comparing human behavior models in repeated Stackelberg security games: An extended study Kar, Debarun
2016
182-183 C p. 65-103
39 p.
article
140 Compatibility, desirability, and the running intersection property Miranda, Enrique

182-183 C p.
article
141 Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty Bhargava, Nikhil
2019
182-183 C p. 1-17
article
142 Complexity issues related to propagation completeness Babka, Martin
2013
182-183 C p. 19-34
16 p.
article
143 Complexity of abstract argumentation under a claim-centric view Dvořák, Wolfgang

182-183 C p.
article
144 Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules Davies, Jessica
2014
182-183 C p. 20-42
23 p.
article
145 Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence Fazzinga, Bettina
2019
182-183 C p. 1-29
article
146 Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting Lukasiewicz, Thomas
2019
182-183 C p. 101-142
article
147 Complexity-sensitive decision procedures for abstract argumentation Dvořák, Wolfgang
2014
182-183 C p. 53-78
26 p.
article
148 Computational complexity of linear constraints over the integers Jonsson, Peter
2013
182-183 C p. 44-62
19 p.
article
149 Computational protein design as an optimization problem Allouche, David
2014
182-183 C p. 59-79
21 p.
article
150 Computer-aided proof of Erdős discrepancy properties Konev, Boris
2015
182-183 C p. 103-118
16 p.
article
151 Computer models solving intelligence test problems: Progress and implications Hernández-Orallo, José
2016
182-183 C p. 74-107
34 p.
article
152 Computer proofs of limit theorems Bledsoe, W.W
1972
182-183 C p. 27-60
34 p.
article
153 Computing AES related-key differential characteristics with constraint programming Gerault, David

182-183 C p.
article
154 Computing and restoring global inverse consistency in interactive constraint satisfaction Bessiere, Christian
2016
182-183 C p. 153-169
17 p.
article
155 Computing a small agreeable set of indivisible items Manurangsi, Pasin
2019
182-183 C p. 96-114
article
156 Computing cooperative solution concepts in coalitional skill games Bachrach, Yoram
2013
182-183 C p. 1-21
21 p.
article
157 Computing desirable partitions in additively separable hedonic games Aziz, Haris
2013
182-183 C p. 316-334
19 p.
article
158 Computing programs for generalized planning using a classical planner Segovia-Aguas, Javier
2019
182-183 C p. 52-85
article
159 Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types Rabinovich, Zinovi
2013
182-183 C p. 106-139
34 p.
article
160 Concept drift detection via competence models Lu, Ning
2014
182-183 C p. 11-28
18 p.
article
161 Concurrent forward bounding for distributed constraint optimization problems Netzer, Arnon
2012
182-183 C p. 186-216
31 p.
article
162 Confidence-based reasoning in stochastic constraint programming Rossi, Roberto
2015
182-183 C p. 129-152
24 p.
article
163 Conflict-based search for optimal multi-agent pathfinding Sharon, Guni
2015
182-183 C p. 40-66
27 p.
article
164 Conflict-driven answer set solving: From theory to practice Gebser, Martin
2012
182-183 C p. 52-89
38 p.
article
165 Consequence-based and fixed-parameter tractable reasoning in description logics Simančík, František
2014
182-183 C p. 29-77
49 p.
article
166 Constants and finite unary relations in qualitative constraint reasoning Jonsson, Peter
2018
182-183 C p. 1-23
article
167 Constrained clustering by constraint programming Dao, Thi-Bich-Hanh
2017
182-183 C p. 70-94
25 p.
article
168 Constrained coalition formation on valuation structures: Formal framework, applications, and islands of tractability Greco, Gianluigi
2017
182-183 C p. 19-46
28 p.
article
169 Constraint acquisition Bessiere, Christian
2017
182-183 C p. 315-342
28 p.
article
170 Constraint propagation as information maximization Nait Abdallah, A.
2013
182-183 C p. 25-38
14 p.
article
171 Construction of system of spheres-based transitively relational partial meet multiple contractions: An impossibility result Reis, Maurício D.L.
2016
182-183 C p. 122-141
20 p.
article
172 Continual curiosity-driven skill acquisition from high-dimensional video inputs for humanoid robots Kompella, Varun Raj
2017
182-183 C p. 313-335
23 p.
article
173 Cooperative games with overlapping coalitions: Charting the tractability frontier Zick, Yair
2019
182-183 C p. 74-97
article
174 Cooperative hierarchical Dirichlet processes: Superposition vs. maximization Xuan, Junyu
2019
182-183 C p. 43-73
article
175 Corrigendum to “A general account of argumentation with preferences” [Artif. Intell. 195 (2013) 361–397] Modgil, Sanjay
2018
182-183 C p. 107-110
article
176 Corrigendum to “Sequential plan recognition: An iterative approach to disambiguating between hypotheses” [Artif. Intell. 260 (2018) 51–73] Mirsky, Reuth
2019
182-183 C p. 234
article
177 Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability Berg, Jeremias
2017
182-183 C p. 110-142
33 p.
article
178 CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement Grastien, Alban

182-183 C p.
article
179 CROSS cyclic resource-constrained scheduling solver Bonfietti, Alessio
2014
182-183 C p. 25-52
28 p.
article
180 CTL update of Kripke models through protections Carrillo, Miguel
2014
182-183 C p. 51-74
24 p.
article
181 Dashed strings for string constraint solving Amadini, Roberto

182-183 C p.
article
182 Data complexity of query answering in description logics Calvanese, Diego
2013
182-183 C p. 335-360
26 p.
article
183 Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies Kaminski, Mark
2016
182-183 C p. 90-118
29 p.
article
184 Data repair of inconsistent nonmonotonic description logic programs Eiter, Thomas
2016
182-183 C p. 7-53
47 p.
article
185 Decentralized Reinforcement Learning of Robot Behaviors Leottau, David L.
2018
182-183 C p. 130-159
article
186 Decomposition and tractability in qualitative spatial and temporal reasoning Huang, Jinbo
2013
182-183 C p. 140-164
25 p.
article
187 Definability for model counting Lagniez, Jean-Marie

182-183 C p.
article
188 DEL-based epistemic planning: Decidability and complexity Bolander, Thomas

182-183 C p.
article
189 Deliberation for autonomous robots: A survey Ingrand, Félix
2017
182-183 C p. 10-44
35 p.
article
190 Democratic fair allocation of indivisible goods Segal-Halevi, Erel
2019
182-183 C p.
article
191 Depth-based short-sighted stochastic shortest path problems Trevizan, Felipe W.
2014
182-183 C p. 179-205
27 p.
article
192 Design and results of the Fifth Answer Set Programming Competition Calimeri, Francesco
2016
182-183 C p. 151-181
31 p.
article
193 Design and results of the Second International Competition on Computational Models of Argumentation Gaggl, Sarah A.

182-183 C p.
article
194 Designing normative theories for ethical and legal reasoning: LogiKEy framework, methodology, and tool support Benzmüller, Christoph

182-183 C p.
article
195 Detection of semantic errors in Arabic texts Ben Othmane Zribi, Chiraz
2013
182-183 C p. 249-264
16 p.
article
196 Determining inference semantics for disjunctive logic programs Shen, Yi-Dong
2019
182-183 C p.
article
197 Differential evolution for noisy multiobjective optimization Rakshit, Pratyusha
2015
182-183 C p. 165-189
25 p.
article
198 Diffusion centrality: A paradigm to maximize spread in social networks Kang, Chanhyun
2016
182-183 C p. 70-96
27 p.
article
199 Discovering hidden structure in factored MDPs Kolobov, Andrey
2012
182-183 C p. 19-47
29 p.
article
200 Discovering visual concept structure with sparse and incomplete tags Wang, Jingya
2017
182-183 C p. 16-36
21 p.
article
201 Disjunctive closures for knowledge compilation Fargier, Hélène
2014
182-183 C p. 129-162
34 p.
article
202 Distributed fair allocation of indivisible goods Chevaleyre, Yann
2017
182-183 C p. 1-22
22 p.
article
203 Distributed First Order Logic Ghidini, Chiara
2017
182-183 C p. 1-39
39 p.
article
204 Distributed monitoring of election winners Filtser, Arnold
2019
182-183 C p. 79-104
article
205 Distributional semantics of objects in visual scenes in comparison to text Lüddecke, Timo
2019
182-183 C p. 44-65
article
206 Does the world look different in different languages? Davis, Ernest
2015
182-183 C p. 202-209
8 p.
article
207 Domain expansion for ASP-programs with external sources Eiter, Thomas
2016
182-183 C p. 84-121
38 p.
article
208 Domain-independent planning for services in uncertain and dynamic environments Kaldeli, Eirini
2016
182-183 C p. 30-64
35 p.
article
209 Dynamically improved bounds bidirectional search Sewell, E.C.

182-183 C p.
article
210 Dynamics in matching and coalition formation games with structural constraints Hoefer, Martin

182-183 C p. 222-247
article
211 Dynamic term-modal logics for first-order epistemic planning Occhipinti Liberman, Andrés

182-183 C p.
article
212 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
213 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
214 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
215 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
216 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
217 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
218 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
219 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
220 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
221 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
222 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
223 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
224 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
225 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
226 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
227 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
228 Editorial Board 1972
182-183 C p. IFC-
1 p.
article
229 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
230 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
231 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
232 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
233 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
234 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
235 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
236 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
237 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
238 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
239 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
240 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
241 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
242 Editorial Board 2015
182-183 C p. IFC-
1 p.
article
243 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
244 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
245 Editorial Board 2019
182-183 C p. ii
article
246 Editorial Board 2019
182-183 C p. ii
article
247 Editorial Board 2018
182-183 C p. ii
article
248 Editorial Board 2019
182-183 C p. ii
article
249 Editorial Board 2018
182-183 C p. ii
article
250 Editorial Board 2018
182-183 C p. ii
article
251 Editorial Board 2019
182-183 C p. ii
article
252 Editorial Board 2019
182-183 C p. ii
article
253 Editorial Board 2019
182-183 C p. ii
article
254 Editorial Board 2019
182-183 C p. ii
article
255 Editorial Board 2019
182-183 C p. ii
article
256 Editorial Board 2019
182-183 C p. ii
article
257 Editorial Board 2019
182-183 C p. ii
article
258 Editorial Board 2019
182-183 C p. ii
article
259 Editorial Board 2019
182-183 C p.
article
260 Editorial Board
182-183 C p.
article
261 Editorial Board
182-183 C p.
article
262 Editorial Board
182-183 C p.
article
263 Editorial Board
182-183 C p. ii
article
264 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
265 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
266 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
267 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
268 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
269 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
270 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
271 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
272 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
273 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
274 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
275 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
276 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
277 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
278 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
279 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
280 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
281 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
282 Editorial Board 2012
182-183 C p. IFC-
1 p.
article
283 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
284 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
285 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
286 Editorial Board 2013
182-183 C p. IFC-
1 p.
article
287 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
288 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
289 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
290 Editorial Board 2014
182-183 C p. IFC-
1 p.
article
291 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
292 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
293 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
294 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
295 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
296 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
297 Editorial Board 2016
182-183 C p. IFC-
1 p.
article
298 Editorial Board 2018
182-183 C p. ii
article
299 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
300 Editorial Board 2018
182-183 C p. ii
article
301 Editorial Board 2018
182-183 C p. ii
article
302 Editorial Board 2018
182-183 C p. ii
article
303 Editorial Board 2018
182-183 C p. ii
article
304 Editorial Board 2018
182-183 C p. ii
article
305 Editorial Board 2018
182-183 C p. IFC-
1 p.
article
306 Editorial Board 2017
182-183 C p. IFC-
1 p.
article
307 Editorial Board 2018
182-183 C p. ii
article
308 Editorial Board
182-183 C p.
article
309 Editorial Board
182-183 C p.
article
310 Editorial Board
182-183 C p.
article
311 Editorial Board
182-183 C p.
article
312 Editorial Board
182-183 C p.
article
313 Editorial Board
182-183 C p.
article
314 Editorial Board
182-183 C p.
article
315 Editorial Board
182-183 C p.
article
316 Editorial Board
182-183 C p.
article
317 Editorial Board
182-183 C p.
article
318 Effective footstep planning using homotopy-class guidance Ranganeni, Vinitha

182-183 C p.
article
319 Efficiency and complexity of price competition among single-product vendors Caragiannis, Ioannis
2017
182-183 C p. 9-25
17 p.
article
320 Efficient algorithms for game-theoretic betweenness centrality Szczepański, Piotr L.
2016
182-183 C p. 39-63
25 p.
article
321 Efficient crowdsourcing of unknown experts using bounded multi-armed bandits Tran-Thanh, Long
2014
182-183 C p. 89-111
23 p.
article
322 Efficient interactive decision-making framework for robotic applications Agostini, Alejandro
2017
182-183 C p. 187-212
26 p.
article
323 Efficient nonconvex sparse group feature selection via continuous and discrete optimization Xiang, Shuo
2015
182-183 C p. 28-50
23 p.
article
324 Efficient symbolic search for cost-optimal planning Torralba, Álvaro
2017
182-183 C p. 52-79
28 p.
article
325 Eliciting good teaching from humans for machine learners Cakmak, Maya
2014
182-183 C p. 198-215
18 p.
article
326 Empathetic decision making in social networks Salehi-Abari, Amirali
2019
182-183 C p. 174-203
article
327 Empirical decision model learning Lombardi, Michele
2017
182-183 C p. 343-367
25 p.
article
328 Encoding implicit relation requirements for relation extraction: A joint inference approach Chen, Liwei
2018
182-183 C p. 45-66
article
329 End-user feature labeling: Supervised and semi-supervised approaches based on locally-weighted logistic regression Das, Shubhomoy
2013
182-183 C p. 56-74
19 p.
article
330 Enhancing context knowledge repositories with justifiable exceptions Bozzato, Loris
2018
182-183 C p. 72-126
article
331 e-NSP: Efficient negative sequential pattern mining Cao, Longbing
2016
182-183 C p. 156-182
27 p.
article
332 Entropy-based pruning for learning Bayesian networks using BIC de Campos, Cassio P.
2018
182-183 C p. 42-50
article
333 Envisioning the qualitative effects of robot manipulation actions using simulation-based projections Kunze, Lars
2017
182-183 C p. 352-380
29 p.
article
334 Epistemic graphs for representing and reasoning with positive and negative influences of arguments Hunter, Anthony

182-183 C p.
article
335 Erratum to ‘A logic for reasoning about ambiguity’ [Artificial Intelligence 209 (2014) 1–10] Halpern, Joseph Y.
2014
182-183 C p. 158-
1 p.
article
336 Estimating the probability of meeting a deadline in schedules and plans Cohen, Liat
2019
182-183 C p. 329-355
article
337 Ethical approaches and autonomous systems Bench-Capon, T.J.M.

182-183 C p.
article
338 Ethical guidelines for a superintelligence Davis, Ernest
2015
182-183 C p. 121-124
4 p.
article
339 Evaluating epistemic negation in answer set programming Shen, Yi-Dong
2016
182-183 C p. 115-135
21 p.
article
340 Evaluating local explanation methods on ground truth Guidotti, Riccardo

182-183 C p.
article
341 Evaluating practical negotiating agents: Results and analysis of the 2011 international competition Baarslag, Tim
2013
182-183 C p. 73-103
31 p.
article
342 Evaluating XAI: A comparison of rule-based and example-based explanations van der Waa, Jasper

182-183 C p.
article
343 Evaluation of a simple, scalable, parallel best-first search strategy Kishimoto, Akihiro
2013
182-183 C p. 222-248
27 p.
article
344 Evaluation of the moral permissibility of action plans Lindner, Felix

182-183 C p.
article
345 Evidential reasoning rule for evidence combination Yang, Jian-Bo
2013
182-183 C p. 1-29
29 p.
article
346 Explanation in AI and law: Past, present and future Atkinson, Katie

182-183 C p.
article
347 Explanation in artificial intelligence: Insights from the social sciences Miller, Tim
2019
182-183 C p. 1-38
article
348 Exploiting local and repeated structure in Dynamic Bayesian Networks Vlasselaer, Jonas
2016
182-183 C p. 43-53
11 p.
article
349 Exploiting meta features for dependency parsing and part-of-speech tagging Chen, Wenliang
2016
182-183 C p. 173-191
19 p.
article
350 Exploiting persistent mappings in cross-domain analogical learning of physical domains Klenk, Matthew
2013
182-183 C p. 398-417
20 p.
article
351 Exploiting reverse target-side contexts for neural machine translation via asynchronous bidirectional decoding Su, Jinsong
2019
182-183 C p.
article
352 Exploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains Kang, Byung Kon
2012
182-183 C p. 32-57
26 p.
article
353 Explorative anytime local search for distributed constraint optimization Zivan, Roie
2014
182-183 C p. 1-26
26 p.
article
354 Extracting mutual exclusion invariants from lifted temporal planning domains Bernardini, Sara
2018
182-183 C p. 1-65
article
355 Extracting qualitative relations from categorical data Žabkar, Jure
2016
182-183 C p. 54-69
16 p.
article
356 Fair assignment of indivisible objects under ordinal preferences Aziz, Haris
2015
182-183 C p. 71-92
22 p.
article
357 Fair navigation planning: A resource for characterizing and designing fairness in mobile robots Brandão, Martim

182-183 C p.
article
358 Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy Fernández-González, Daniel
2019
182-183 C p. 559-574
article
359 Feature assembly method for extracting relations in Chinese Chen, Yanping
2015
182-183 C p. 179-194
16 p.
article
360 Filtering algorithms for global chance constraints Hnich, Brahim
2012
182-183 C p. 69-94
26 p.
article
361 Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel task scheduling problem Fages, Jean-Guillaume
2014
182-183 C p. 116-133
18 p.
article
362 Finding a collective set of items: From proportional multirepresentation to group recommendation Skowron, Piotr
2016
182-183 C p. 191-216
26 p.
article
363 Finding core for coalition structure utilizing dual solution Iwasaki, Atsushi
2015
182-183 C p. 49-66
18 p.
article
364 Finding explanations of inconsistency in multi-context systems Eiter, Thomas
2014
182-183 C p. 233-274
42 p.
article
365 First competition section paper published Lakemeyer, G.
2013
182-183 C p. 72-
1 p.
article
366 First-order stable model semantics with intensional functions Bartholomew, Michael
2019
182-183 C p. 56-93
article
367 Fixed point semantics for stream reasoning Antić, Christian

182-183 C p.
article
368 Fixing balanced knockout and double elimination tournaments Aziz, Haris

182-183 C p. 1-14
article
369 Fixpoint semantics for active integrity constraints Bogaerts, Bart
2018
182-183 C p. 43-70
article
370 Flexibility and decoupling in Simple Temporal Networks Wilson, Michel
2014
182-183 C p. 26-44
19 p.
article
371 FLP answer set semantics without circular justifications for general logic programs Shen, Yi-Dong
2014
182-183 C p. 1-41
41 p.
article
372 Forgetting auxiliary atoms in forks Aguado, Felicidad
2019
182-183 C p. 575-601
article
373 Forgetting in multi-agent modal logics Fang, Liangda
2019
182-183 C p. 51-80
article
374 Forming k coalitions and facilitating relationships in social networks Sless, Liat
2018
182-183 C p. 217-245
article
375 Forward bounding on pseudo-trees for DCOPs and ADCOPs Litov, Omer
2017
182-183 C p. 83-99
17 p.
article
376 Foundations of ontology-based data access under bag semantics Nikolaou, Charalampos
2019
182-183 C p. 91-132
article
377 Fractals and Ravens McGreggor, Keith
2014
182-183 C p. 1-23
23 p.
article
378 Framing reinforcement learning from human reward: Reward positivity, temporal discounting, episodicity, and performance Knox, W. Bradley
2015
182-183 C p. 24-50
27 p.
article
379 From iterated revision to iterated contraction: Extending the Harper Identity Booth, Richard
2019
182-183 C p.
article
380 From model checking to equilibrium checking: Reactive modules for rational verification Gutierrez, Julian
2017
182-183 C p. 123-157
35 p.
article
381 From senses to texts: An all-in-one graph-based approach for measuring semantic similarity Pilehvar, Mohammad Taher
2015
182-183 C p. 95-128
34 p.
article
382 Fundamental properties of attack relations in structured argumentation with priorities Dung, Phan Minh
2018
182-183 C p. 1-42
article
383 Games for query inseparability of description logic knowledge bases Botoeva, Elena
2016
182-183 C p. 78-119
42 p.
article
384 GAMoN: Discovering M-of- N { ¬ , ∨ } hypotheses for text classification by a lattice-based Genetic Algorithm Policicchio, Veronica L.
2012
182-183 C p. 61-95
35 p.
article
385 Gelfond–Zhang aggregates as propositional formulas Cabalar, Pedro
2019
182-183 C p. 26-43
article
386 Generalized mirror descents in congestion games Chen, Po-An
2016
182-183 C p. 217-243
27 p.
article
387 Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertainty Dubois, Didier
2017
182-183 C p. 139-174
36 p.
article
388 Generating custom propagators for arbitrary constraints Gent, Ian P.
2014
182-183 C p. 1-33
33 p.
article
389 Generating diverse plans to handle unknown and partially known user preferences Nguyen, Tuan Anh
2012
182-183 C p. 1-31
31 p.
article
390 Generating SAT instances with community structure Giráldez-Cru, Jesús
2016
182-183 C p. 119-134
16 p.
article
391 Geometric backtracking for combined task and motion planning in robotic systems Bidot, Julien
2017
182-183 C p. 229-265
37 p.
article
392 Governing convergence of Max-sum on DCOPs through damping and splitting Cohen, Liel

182-183 C p.
article
393 Gradient conjugate priors and multi-layer neural networks Gurevich, Pavel

182-183 C p.
article
394 Graph aggregation Endriss, Ulle
2017
182-183 C p. 86-114
29 p.
article
395 Grounded fixpoints and their applications in knowledge representation Bogaerts, Bart
2015
182-183 C p. 51-71
21 p.
article
396 Grounded language interpretation of robotic commands through structured learning Vanzo, Andrea

182-183 C p.
article
397 Guarantees and limits of preprocessing in constraint satisfaction and reasoning Gaspers, Serge
2014
182-183 C p. 1-19
19 p.
article
398 Handling and measuring inconsistency in non-monotonic logics Ulbricht, Markus

182-183 C p.
article
399 Hidden protocols: Modifying our expectations in an evolving world van Ditmarsch, Hans
2014
182-183 C p. 18-40
23 p.
article
400 Hierarchical conceptual spaces for concept combination Lewis, Martha
2016
182-183 C p. 204-227
24 p.
article
401 Hierarchical semi-Markov conditional random fields for deep recursive sequential data Tran, Truyen
2017
182-183 C p. 53-85
33 p.
article
402 H-index manipulation by merging articles: Models, theory, and experiments van Bevern, René
2016
182-183 C p. 19-35
17 p.
article
403 How do fairness definitions fare? Testing public attitudes towards three algorithmic definitions of fairness in loan allocations Saxena, Nripsuta Ani

182-183 C p.
article
404 How many diagnoses do we need? Stern, Roni
2017
182-183 C p. 26-45
20 p.
article
405 How much does it help to know what she knows you know? An agent-based simulation study de Weerd, Harmen
2013
182-183 C p. 67-92
26 p.
article
406 How to progress a database III Vassos, Stavros
2013
182-183 C p. 203-221
19 p.
article
407 How we designed winning algorithms for abstract argumentation and which insight we attained Cerutti, Federico
2019
182-183 C p. 1-40
article
408 HTN planning: Overview, comparison, and beyond Georgievski, Ilche
2015
182-183 C p. 124-156
33 p.
article
409 Human–computer negotiation in a three player market setting Haim, Galit
2017
182-183 C p. 34-52
19 p.
article
410 Implicit, explicit and speculative knowledge van Ditmarsch, Hans
2018
182-183 C p. 35-67
article
411 Importance sampling-based estimation over AND/OR search spaces for graphical models Gogate, Vibhav
2012
182-183 C p. 38-77
40 p.
article
412 Impossibility in belief merging Mata Díaz, Amílcar
2017
182-183 C p. 1-34
34 p.
article
413 Improving resource allocation strategies against human adversaries in security games: An extended study Yang, Rong
2013
182-183 C p. 440-469
30 p.
article
414 Incentive-based search for efficient equilibria of the public goods game Levit, Vadim

182-183 C p. 142-162
article
415 Incentive engineering for Boolean games Wooldridge, Michael
2013
182-183 C p. 418-439
22 p.
article
416 Incentivizing evaluation with peer prediction and limited access to ground truth Gao, Xi Alice
2019
182-183 C p. 618-638
article
417 Inconsistency measures for probabilistic logics Thimm, Matthias
2013
182-183 C p. 1-24
24 p.
article
418 Incorporating weights into real-time heuristic search Rivera, Nicolás
2015
182-183 C p. 1-23
23 p.
article
419 Increasing threshold search for best-valued agents Shamoun, Simon
2013
182-183 C p. 1-21
21 p.
article
420 Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems Benabbou, Nawal
2017
182-183 C p. 152-180
29 p.
article
421 Inducing semantic relations from conceptual spaces: A data-driven approach to plausible reasoning Derrac, Joaquín
2015
182-183 C p. 66-94
29 p.
article
422 Infinitary equilibrium logic and strongly equivalent logic programs Harrison, Amelia
2017
182-183 C p. 22-33
12 p.
article
423 Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information Powley, Edward J.
2014
182-183 C p. 92-116
25 p.
article
424 Information-geometric approach to inferring causal directions Janzing, Dominik
2012
182-183 C p. 1-31
31 p.
article
425 Integer Linear Programming for the Bayesian network structure learning problem Bartlett, Mark
2017
182-183 C p. 258-271
14 p.
article
426 Integrating representation learning and skill learning in a human-like intelligent agent Li, Nan
2015
182-183 C p. 67-91
25 p.
article
427 Integrating social power into the decision-making of cognitive agents Pereira, Gonçalo
2016
182-183 C p. 1-44
44 p.
article
428 Intelligent agent supporting human–multi-robot team collaboration Rosenfeld, Ariel
2017
182-183 C p. 211-231
21 p.
article
429 Intention as commitment toward time van Zee, Marc

182-183 C p.
article
430 Interestingness elements for explainable reinforcement learning: Understanding agents' capabilities and limitations Sequeira, Pedro

182-183 C p.
article
431 Interpolative and extrapolative reasoning in propositional theories using qualitative knowledge about conceptual spaces Schockaert, Steven
2013
182-183 C p. 86-131
46 p.
article
432 Interpretable time series kernel analytics by pre-image estimation Tran, Thi Phuong Thao

182-183 C p.
article
433 Interpretation of imperfect line data as a three-dimensional scene Falk, Gilbert
1972
182-183 C p. 101-144
44 p.
article
434 Intrinsically motivated model learning for developing curious robots Hester, Todd
2017
182-183 C p. 170-186
17 p.
article
435 Intrinsic approaches to prioritizing diagnoses in multi-context systems Mu, Kedian

182-183 C p.
article
436 Introducing article numbering to Artificial Intelligence Roffel, Sweitze

182-183 C p.
article
437 Introduction to the special issue on Combining Constraint Solving with Mining and Learning Passerini, Andrea
2017
182-183 C p. 1-5
5 p.
article
438 Item response theory in AI: Analysing machine learning classifiers at the instance level Martínez-Plumed, Fernando
2019
182-183 C p. 18-42
article
439 Iterative voting and acyclic games Meir, Reshef
2017
182-183 C p. 100-122
23 p.
article
440 Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm Horn, Matthias
2019
182-183 C p.
article
441 Joint search with self-interested agents and the failure of cooperation enhancers Rochlin, Igor
2014
182-183 C p. 45-65
21 p.
article
442 kLog: A language for logical and relational learning with kernels Frasconi, Paolo
2014
182-183 C p. 117-143
27 p.
article
443 Knowing-how under uncertainty Naumov, Pavel
2019
182-183 C p. 41-56
article
444 Knowing the price of success Cao, Rui

182-183 C p.
article
445 Knowledge-based programs as succinct policies for partially observable domains Zanuttini, Bruno

182-183 C p.
article
446 Knowledge base exchange: The case of OWL 2 QL Arenas, Marcelo
2016
182-183 C p. 11-62
52 p.
article
447 Lakatos-style collaborative mathematics through dialectical, structured and abstract argumentation Pease, Alison
2017
182-183 C p. 181-219
39 p.
article
448 Landmark-based approaches for goal recognition as planning Pereira, Ramon Fraga

182-183 C p.
article
449 Landmark-enhanced abstraction heuristics Domshlak, Carmel
2012
182-183 C p. 48-68
21 p.
article
450 Language independent sequence labelling for Opinion Target Extraction Agerri, Rodrigo
2019
182-183 C p. 85-95
article
451 LARS: A Logic-based framework for Analytic Reasoning over Streams Beck, Harald
2018
182-183 C p. 16-70
article
452 Latent tree models for hierarchical topic detection Chen, Peixian
2017
182-183 C p. 105-124
20 p.
article
453 Law and logic: A review from an argumentation perspective Prakken, Henry
2015
182-183 C p. 214-245
32 p.
article
454 Leadership in singleton congestion games: What is hard and what is easy Castiglioni, Matteo
2019
182-183 C p.
article
455 Learning action models with minimal observability Aineto, Diego
2019
182-183 C p. 104-137
article
456 Learning and executing generalized robot plans Fikes, Richard E
1972
182-183 C p. 251-288
38 p.
article
457 Learning an efficient constructive sampler for graphs Costa, Fabrizio
2017
182-183 C p. 217-238
22 p.
article
458 Learning Bayesian network parameters under equivalence constraints Yao, Tiansheng
2017
182-183 C p. 239-257
19 p.
article
459 Learning Boolean specifications Bubeck, U.
2015
182-183 C p. 246-257
12 p.
article
460 Learning from others: Exchange of classification rules in intelligent distributed systems Fisch, Dominik
2012
182-183 C p. 90-114
25 p.
article
461 Learning general constraints in CSP Veksler, Michael
2016
182-183 C p. 135-153
19 p.
article
462 Learning hierarchical task network domains from partially observed plan traces Zhuo, Hankz Hankui
2014
182-183 C p. 134-157
24 p.
article
463 Learning in the machine: Random backpropagation and the deep learning channel Baldi, Pierre
2018
182-183 C p. 1-35
article
464 Learning pseudo-tags to augment sparse tagging in hybrid music recommender systems Horsburgh, Ben
2015
182-183 C p. 25-39
15 p.
article
465 Learning tractable Bayesian networks in the space of elimination orders Benjumeda, Marco
2019
182-183 C p. 66-90
article
466 Lifting integrity constraints in binary aggregation Grandi, Umberto
2013
182-183 C p. 45-66
22 p.
article
467 Limitations of acyclic causal graphs for planning Jonsson, Anders
2014
182-183 C p. 36-55
20 p.
article
468 Limited lookahead in imperfect-information games Kroer, Christian

182-183 C p.
article
469 Linked taxonomies to capture usersʼ subjective assessments of items to facilitate accurate collaborative filtering Nakatsuji, Makoto
2014
182-183 C p. 52-68
17 p.
article
470 Localising iceberg inconsistencies De Bona, Glauber
2017
182-183 C p. 118-151
34 p.
article
471 Local properties in modal logic van Ditmarsch, Hans
2012
182-183 C p. 133-155
23 p.
article
472 Local search for Boolean Satisfiability with configuration checking and subscore Cai, Shaowei
2013
182-183 C p. 75-98
24 p.
article
473 Logical characterizations of regular equivalence in weighted social networks Fan, Tuan-Fang
2014
182-183 C p. 66-88
23 p.
article
474 Logical foundations of information disclosure in ontology-based data integration Benedikt, Michael

182-183 C p. 52-95
article
475 Lost in translation: Language independence in propositional logic – application to belief change Marquis, Pierre
2014
182-183 C p. 1-24
24 p.
article
476 Low-rank decomposition meets kernel learning: A generalized Nyström method Lan, Liang
2017
182-183 C p. 1-15
15 p.
article
477 Magic Sets for disjunctive Datalog programs Alviano, Mario
2012
182-183 C p. 156-192
37 p.
article
478 Maintenance of datalog materialisations revisited Motik, Boris
2019
182-183 C p. 76-136
article
479 Making friends on the fly: Cooperating with new teammates Barrett, Samuel
2017
182-183 C p. 132-171
40 p.
article
480 Making the right exceptions Bastiaanse, Harald
2016
182-183 C p. 96-118
23 p.
article
481 Manipulating the quota in weighted voting games Zuckerman, Michael
2012
182-183 C p. 1-19
19 p.
article
482 Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms Qian, Chao
2019
182-183 C p. 279-294
article
483 MaxSAT by improved instance-specific algorithm configuration Ansótegui, Carlos
2016
182-183 C p. 26-39
14 p.
article
484 Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation De Bona, Glauber
2015
182-183 C p. 140-164
25 p.
article
485 Measuring inconsistency with constraints for propositional knowledge bases Mu, Kedian
2018
182-183 C p. 52-90
article
486 Memetic algorithms outperform evolutionary algorithms in multimodal optimisation Nguyen, Phan Trung Hai

182-183 C p.
article
487 Memory networks for fine-grained opinion mining Wang, Wenya
2018
182-183 C p. 1-17
article
488 Methods for solving reasoning problems in abstract argumentation – A survey Charwat, Günther
2015
182-183 C p. 28-63
36 p.
article
489 Mind the gaps: Assuring the safety of autonomous systems from an engineering, ethical, and legal perspective Burton, Simon

182-183 C p.
article
490 Minimal change: Relevance and recovery revisited Ribeiro, Márcio M.
2013
182-183 C p. 59-80
22 p.
article
491 Minimal sets on propositional formulae. Problems and reductions Marques-Silva, Joao
2017
182-183 C p. 22-50
29 p.
article
492 Mining Top-k motifs with a SAT-based framework Jabbour, Said
2017
182-183 C p. 30-47
18 p.
article
493 MiningZinc: A declarative framework for constraint-based mining Guns, Tias
2017
182-183 C p. 6-29
24 p.
article
494 Mis- and disinformation in a bounded confidence model Douven, Igor

182-183 C p.
article
495 MM: A bidirectional search algorithm that is guaranteed to meet in the middle Holte, Robert C.
2017
182-183 C p. 232-266
35 p.
article
496 Model-based contextual policy search for data-efficient generalization of robot skills Kupcsik, Andras
2017
182-183 C p. 415-439
25 p.
article
497 Model-based furniture recognition for building semantic object maps Günther, Martin
2017
182-183 C p. 336-351
16 p.
article
498 Modeling information exchange opportunities for effective human–computer teamwork Kamar, Ece
2013
182-183 C p. 528-550
23 p.
article
499 Modeling the complex dynamics and changing correlations of epileptic events Wulsin, Drausin F.
2014
182-183 C p. 55-75
21 p.
article
500 Modelling structured societies: A multi-relational approach to context permeability Nunes, Davide
2015
182-183 C p. 175-199
25 p.
article
501 Model-lite planning: Case-based vs. model-based approaches Zhuo, Hankz Hankui
2017
182-183 C p. 1-21
21 p.
article
502 Model-theoretic inseparability and modularity of description logic ontologies Konev, Boris
2013
182-183 C p. 66-103
38 p.
article
503 Modular robotic systems: Methods and algorithms for abstraction, planning, control, and synchronization Ahmadzadeh, Hossein
2015
182-183 C p. 27-64
38 p.
article
504 Most frugal explanations in Bayesian networks Kwisthout, Johan
2015
182-183 C p. 56-73
18 p.
article
505 Moving average reversion strategy for on-line portfolio selection Li, Bin
2015
182-183 C p. 104-123
20 p.
article
506 Multi-attribute proportional representation Lang, Jérôme
2018
182-183 C p. 74-106
article
507 Multicategory large margin classification methods: Hinge losses vs. coherence functions Zhang, Zhihua
2014
182-183 C p. 55-78
24 p.
article
508 Multiparticipant chat analysis: A survey Uthus, David C.
2013
182-183 C p. 106-121
16 p.
article
509 Multiple instance classification: Review, taxonomy and comparative study Amores, Jaume
2013
182-183 C p. 81-105
25 p.
article
510 Multi-robot adversarial patrolling: Handling sequential attacks Sless Lin, Efrat
2019
182-183 C p. 1-25
article
511 Multi-robot inverse reinforcement learning under occlusion with estimation of state transitions Bogert, Kenneth
2018
182-183 C p. 46-73
article
512 MultiWiBi: The multilingual Wikipedia bitaxonomy project Flati, Tiziano
2016
182-183 C p. 66-102
37 p.
article
513 Nasari: Integrating explicit knowledge and corpus statistics for a multilingual representation of concepts and entities Camacho-Collados, José
2016
182-183 C p. 36-64
29 p.
article
514 Natural strategic ability Jamroga, Wojciech
2019
182-183 C p.
article
515 Near-optimal continuous patrolling with teams of mobile information gathering agents Stranders, R.
2013
182-183 C p. 63-105
43 p.
article
516 Negotiating team formation using deep reinforcement learning Bachrach, Yoram

182-183 C p.
article
517 New local search methods for partial MaxSAT Cai, Shaowei
2016
182-183 C p. 1-18
18 p.
article
518 New models for generating hard random boolean formulas and disjunctive logic programs Amendola, Giovanni

182-183 C p.
article
519 (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL Nikitina, Nadeschda
2014
182-183 C p. 120-140
21 p.
article
520 Normal and strong expansion equivalence for argumentation frameworks Baumann, Ringo
2012
182-183 C p. 18-44
27 p.
article
521 Norm-based mechanism design Bulling, Nils
2016
182-183 C p. 97-142
46 p.
article
522 [No title] Halpern, Joseph Y.
2019
182-183 C p.
article
523 [No title] Bundy, Alan
2012
182-183 C p. 96-97
2 p.
article
524 [No title] qFiasco, Flash
2018
182-183 C p. 36-41
article
525 [No title] An, Bo
2018
182-183 C p. 1-2
article
526 [No title] Israel, David
2017
182-183 C p. 295-300
6 p.
article
527 [No title] Fenton, Norman

182-183 C p.
article
528 Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability Cai, Shaowei

182-183 C p.
article
529 On abstract modular inference systems and solvers Lierler, Yuliya
2016
182-183 C p. 65-89
25 p.
article
530 On coarser interval temporal logics Muñoz-Velasco, Emilio
2019
182-183 C p. 1-26
article
531 On composition of bounded-recall plans Deuser, Kaya

182-183 C p.
article
532 One-pass AUC optimization Gao, Wei
2016
182-183 C p. 1-29
29 p.
article
533 On fair price discrimination in multi-unit markets Flammini, Michele

182-183 C p.
article
534 On influence, stable behavior, and the most influential individuals in networks: A game-theoretic approach Irfan, Mohammad T.
2014
182-183 C p. 79-119
41 p.
article
535 Online belief tracking using regression for contingent planning Brafman, Ronen I.
2016
182-183 C p. 131-152
22 p.
article
536 Online spatio-temporal matching in stochastic and dynamic domains Lowalekar, Meghna
2018
182-183 C p. 71-112
article
537 Online Transfer Learning Zhao, Peilin
2014
182-183 C p. 76-102
27 p.
article
538 On minimal constraint networks Gottlob, Georg
2012
182-183 C p. 42-60
19 p.
article
539 On our best behaviour Levesque, Hector J.
2014
182-183 C p. 27-35
9 p.
article
540 On pruning search trees of impartial games Beling, Piotr

182-183 C p.
article
541 On quasi-inconsistency and its complexity Corea, Carl

182-183 C p.
article
542 On rational entailment for Propositional Typicality Logic Booth, Richard
2019
182-183 C p.
article
543 On redundant topological constraints Li, Sanjiang
2015
182-183 C p. 51-76
26 p.
article
544 On rejected arguments and implicit conflicts: The hidden power of argumentation semantics Baumann, Ringo
2016
182-183 C p. 244-284
41 p.
article
545 On social envy-freeness in multi-unit markets Flammini, Michele
2019
182-183 C p. 1-26
article
546 On strengthening the logic of iterated belief revision: Proper ordinal interval operators Booth, Richard

182-183 C p.
article
547 On the adoption of abductive reasoning for time series interpretation Teijeiro, T.

182-183 C p. 163-188
article
548 On the approximability of Dodgson and Young elections Caragiannis, Ioannis
2012
182-183 C p. 31-51
21 p.
article
549 On the approximation ability of evolutionary optimization with application to minimum set cover Yu, Yang
2012
182-183 C p. 20-33
14 p.
article
550 On the choice of obtaining and disclosing the common value in auctions Sarne, David
2014
182-183 C p. 24-54
31 p.
article
551 On the complexity of inconsistency measurement Thimm, Matthias
2019
182-183 C p. 411-456
article
552 On the complexity of planning for agent teams and its implications for single agent planning Brafman, Ronen I.
2013
182-183 C p. 52-71
20 p.
article
553 On the complexity of reasoning about opinion diffusion under majority dynamics Auletta, Vincenzo

182-183 C p.
article
554 On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables Mauá, Denis Deratani
2013
182-183 C p. 30-38
9 p.
article
555 On the complexity of the partner units decision problem Teppan, Erich Christian
2017
182-183 C p. 112-122
11 p.
article
556 On the conditional independence implication problem: A lattice-theoretic approach Niepert, Mathias
2013
182-183 C p. 29-51
23 p.
article
557 On the consistency of multi-label learning Gao, Wei
2013
182-183 C p. 22-44
23 p.
article
558 On the doubt about margin explanation of boosting Gao, Wei
2013
182-183 C p. 1-18
18 p.
article
559 On the efficiency of data collection for multiple Naïve Bayes classifiers Manino, Edoardo
2019
182-183 C p. 356-378
article
560 On the equivalence of optimal recommendation sets and myopically optimal query sets Viappiani, Paolo

182-183 C p.
article
561 On the evaluation of election outcomes under uncertainty Hazon, Noam
2012
182-183 C p. 1-18
18 p.
article
562 On the expressivity of inconsistency measures Thimm, Matthias
2016
182-183 C p. 120-151
32 p.
article
563 On the graded acceptability of arguments in abstract and instantiated argumentation Grossi, Davide
2019
182-183 C p. 138-173
article
564 On the inference of Turing machines from sample computations Biermann, A.W
1972
182-183 C p. 181-198
18 p.
article
565 On the Input/Output behavior of argumentation frameworks Baroni, Pietro
2014
182-183 C p. 144-197
54 p.
article
566 On the limits of forgetting in Answer Set Programming Gonçalves, Ricardo

182-183 C p.
article
567 On the logical properties of the nonmonotonic description logic DL N Bonatti, P.A.
2017
182-183 C p. 85-111
27 p.
article
568 On the query complexity of selecting minimal sets for monotone predicates Janota, Mikoláš
2016
182-183 C p. 73-83
11 p.
article
569 On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation Schulz, Claudia

182-183 C p. 301-335
article
570 On the revision of informant credibility orders Tamargo, Luciano H.
2014
182-183 C p. 36-58
23 p.
article
571 On the succinctness of some modal logics French, Tim
2013
182-183 C p. 56-85
30 p.
article
572 On the tractability of minimal model computation for some CNF theories Angiulli, Fabrizio
2014
182-183 C p. 56-77
22 p.
article
573 On the value of using group discounts under price competition Meir, Reshef
2014
182-183 C p. 163-178
16 p.
article
574 On topology-related properties of abstract argumentation semantics. A correction and extension to Dynamics of argumentation systems: A division-based method Baroni, Pietro
2014
182-183 C p. 104-115
12 p.
article
575 On truth-gaps, bipolar belief and the assertability of vague propositions Lawry, Jonathan
2012
182-183 C p. 20-41
22 p.
article
576 On updates of hybrid knowledge bases composed of ontologies and rules Slota, Martin
2015
182-183 C p. 33-104
72 p.
article
577 Optimal cost almost-sure reachability in POMDPs Chatterjee, Krishnendu
2016
182-183 C p. 26-48
23 p.
article
578 Optimal cruiser-drone traffic enforcement under energy limitation Rosenfeld, Ariel
2019
182-183 C p.
article
579 Optimal defense against election control by deleting voter groups Yin, Yue
2018
182-183 C p. 32-51
article
580 Optimal social choice functions: A utilitarian view Boutilier, Craig
2015
182-183 C p. 190-213
24 p.
article
581 Optimal Sokoban solving using pattern databases with specific domain knowledge Pereira, André G.
2015
182-183 C p. 52-70
19 p.
article
582 Optimizing group learning: An evolutionary computing approach Douven, Igor
2019
182-183 C p. 235-251
article
583 Optimizing ontology alignments through a Memetic Algorithm using both MatchFmeasure and Unanimous Improvement Ratio Xue, Xingsi
2015
182-183 C p. 65-81
17 p.
article
584 Optimizing positional scoring rules for rank aggregation Caragiannis, Ioannis
2019
182-183 C p. 58-77
article
585 Optimizing with minimum satisfiability Li, Chu Min
2012
182-183 C p. 32-44
13 p.
article
586 Ordered completion for first-order logic programs on finite structures Asuncion, Vernon
2012
182-183 C p. 1-24
24 p.
article
587 Ordered completion for logic programs with aggregates Asuncion, Vernon
2015
182-183 C p. 72-102
31 p.
article
588 Overlapping layered learning MacAlpine, Patrick
2018
182-183 C p. 21-43
23 p.
article
589 Overview and analysis of the SAT Challenge 2012 solver competition Balint, Adrian
2015
182-183 C p. 120-155
36 p.
article
590 Parallelizing SMT solving: Lazy decomposition and conciliation Cheng, Xi
2018
182-183 C p. 127-157
article
591 Parameterised verification for multi-agent systems Kouvaros, Panagiotis
2016
182-183 C p. 152-189
38 p.
article
592 Parametric properties of ideal semantics Dunne, Paul E.
2013
182-183 C p. 1-28
28 p.
article
593 Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity Aziz, Haris
2019
182-183 C p. 57-78
article
594 Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder Basilico, Nicola
2012
182-183 C p. 78-123
46 p.
article
595 Personalized change awareness: Reducing information overload in loosely-coupled teamwork Amir, Ofra
2019
182-183 C p. 204-233
article
596 Physical search problems with probabilistic knowledge Hazon, Noam
2013
182-183 C p. 26-52
27 p.
article
597 Plan aggregation for strong cyclic planning in nondeterministic domains Alford, Ron
2014
182-183 C p. 206-232
27 p.
article
598 Planning as satisfiability: Heuristics Rintanen, Jussi
2012
182-183 C p. 45-86
42 p.
article
599 Playing with knowledge: A virtual player for “Who Wants to Be a Millionaire?” that leverages question answering techniques Molino, Piero
2015
182-183 C p. 157-181
25 p.
article
600 POMDP-based control of workflows for crowdsourcing Dai, Peng
2013
182-183 C p. 52-85
34 p.
article
601 POMDPs under probabilistic semantics Chatterjee, Krishnendu
2015
182-183 C p. 46-72
27 p.
article
602 PopMNet: Generating structured pop music melodies using neural networks Wu, Jian

182-183 C p.
article
603 POPPONENT: Highly accurate, individually and socially efficient opponent preference model in bilateral multi issue negotiations Zafari, Farhad
2016
182-183 C p. 59-91
33 p.
article
604 Potential-based bounded-cost search and Anytime Non-Parametric A ⁎ Stern, Roni
2014
182-183 C p. 1-25
25 p.
article
605 Predicting citywide crowd flows using deep spatio-temporal residual networks Zhang, Junbo
2018
182-183 C p. 147-166
article
606 Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces Lelis, Levi H.S.
2016
182-183 C p. 51-73
23 p.
article
607 Predicting the size of IDA*ʼs search tree Lelis, Levi H.S.
2013
182-183 C p. 53-76
24 p.
article
608 Preference elicitation and robust winner determination for single- and multi-winner social choice Lu, Tyler

182-183 C p.
article
609 Preservation of semantic properties in collective argumentation: The case of aggregating abstract argumentation frameworks Chen, Weiwei
2019
182-183 C p. 27-48
article
610 Price of Pareto Optimality in hedonic games Elkind, Edith

182-183 C p.
article
611 Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs Grinshpoun, Tal
2019
182-183 C p. 27-50
article
612 Probabilistic reasoning about epistemic action narratives D'Asaro, Fabio Aurelio

182-183 C p.
article
613 Probabilistic sentence satisfiability: An approach to PSAT Henderson, T.C.

182-183 C p.
article
614 Probability and time Zaffalon, Marco
2013
182-183 C p. 1-51
51 p.
article
615 Probability pooling for dependent agents in collective learning Lawry, Jonathan

182-183 C p.
article
616 Probably bounded suboptimal heuristic search Stern, Roni
2019
182-183 C p. 39-57
article
617 Protecting elections by recounting ballots Elkind, Edith

182-183 C p.
article
618 Proving semantic properties as first-order satisfiability Lucas, Salvador
2019
182-183 C p.
article
619 Pruning external minimality checking for answer set programs using semantic dependencies Eiter, Thomas

182-183 C p.
article
620 Qualitative case-based reasoning and learning Homem, Thiago Pedro Donadon

182-183 C p.
article
621 Qualitative constraint satisfaction problems: An extended framework with landmarks Li, Sanjiang
2013
182-183 C p. 32-58
27 p.
article
622 Qualitative reasoning about relative direction of oriented points Mossakowski, Till
2012
182-183 C p. 34-45
12 p.
article
623 Quantifying controllability in temporal networks with uncertainty Akmal, Shyan

182-183 C p.
article
624 Query efficient posterior estimation in scientific experiments via Bayesian active learning Kandasamy, Kirthevasan
2017
182-183 C p. 45-56
12 p.
article
625 Querying incomplete information in RDF with SPARQL Nikolaou, Charalampos
2016
182-183 C p. 138-171
34 p.
article
626 Query inseparability for ALC ontologies Botoeva, Elena
2019
182-183 C p. 1-51
article
627 Rational closure for all description logics Bonatti, P.A.
2019
182-183 C p. 197-223
article
628 Rational deployment of multiple heuristics in optimal state-space search Karpas, Erez
2018
182-183 C p. 181-210
article
629 Reactive multi-context systems: Heterogeneous reasoning in dynamic environments Brewka, Gerhard
2018
182-183 C p. 68-104
article
630 Realizability of three-valued semantics for abstract dialectical frameworks Pührer, Jörg

182-183 C p.
article
631 Realizing RCC8 networks using convex regions Schockaert, Steven
2015
182-183 C p. 74-105
32 p.
article
632 Real-time dynamic programming for Markov decision processes with imprecise probabilities Delgado, Karina V.
2016
182-183 C p. 192-223
32 p.
article
633 Real-time reasoning in OWL2 for GDPR compliance Bonatti, Piero A.

182-183 C p.
article
634 Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems Belle, Vaishak

182-183 C p. 189-221
article
635 Recursively modeling other agents for decision making: A research perspective Doshi, Prashant

182-183 C p.
article
636 Red–black planning: A new systematic approach to partial delete relaxation Domshlak, Carmel
2015
182-183 C p. 73-114
42 p.
article
637 Regression and progression in stochastic domains Belle, Vaishak

182-183 C p.
article
638 Reinforcement learning with limited reinforcement: Using Bayes risk for active learning in POMDPs Doshi-Velez, Finale
2012
182-183 C p. 115-132
18 p.
article
639 Relating constraint answer set programming languages and algorithms Lierler, Yuliya
2014
182-183 C p. 1-22
22 p.
article
640 Relational linear programming Kersting, Kristian
2017
182-183 C p. 188-216
29 p.
article
641 Relational reinforcement learning with guided demonstrations Martínez, David
2017
182-183 C p. 295-312
18 p.
article
642 Relations of epistemic proximity for belief change Hansson, Sven Ove
2014
182-183 C p. 76-91
16 p.
article
643 Relevance in belief revision Peppas, Pavlos
2015
182-183 C p. 126-138
13 p.
article
644 Rendezvous in planar environments with obstacles and unknown initial distance Ozsoyeller, Deniz
2019
182-183 C p. 19-36
article
645 Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems Mechqrane, Younes

182-183 C p.
article
646 Representation learning with extreme learning machines and empirical mode decomposition for wind speed forecasting methods Yang, Hao-Fan
2019
182-183 C p.
article
647 Representations for robot knowledge in the KnowRob framework Tenorth, Moritz
2017
182-183 C p. 151-169
19 p.
article
648 Representing and planning with interacting actions and privacy Shekhar, Shashank

182-183 C p.
article
649 Reprint of “Robert Kowalski, Computational Logic and Human Thinking: How to Be Artificially Intelligent, 2011” Bundy, Alan
2013
182-183 C p. 122-123
2 p.
article
650 Resolving distributed knowledge Ågotnes, Thomas
2017
182-183 C p. 1-21
21 p.
article
651 Rethinking epistemic logic with belief bases Lorini, Emiliano

182-183 C p.
article
652 Review of Anderson and Anderson's Machine Ethics Siler, Cory
2015
182-183 C p. 200-201
2 p.
article
653 Review of Stirling's Theory of Conditional Games Siler, Cory
2016
182-183 C p. 136-137
2 p.
article
654 Revision in networks of ontologies Euzenat, Jérôme
2015
182-183 C p. 195-216
22 p.
article
655 Ridesharing car detection by transfer learning Wang, Leye
2019
182-183 C p. 1-18
article
656 RoboCup@Home: Analysis and results of evolving competitions for domestic and service robots Iocchi, Luca
2015
182-183 C p. 258-281
24 p.
article
657 Robotic manipulation of multiple objects as a POMDP Pajarinen, Joni
2017
182-183 C p. 213-228
16 p.
article
658 Robot task planning and explanation in open and uncertain worlds Hanheide, Marc
2017
182-183 C p. 119-150
32 p.
article
659 Robust learning with imperfect privileged information Li, Xue

182-183 C p.
article
660 Robust multilingual Named Entity Recognition with shallow semi-supervised features Agerri, Rodrigo
2016
182-183 C p. 63-82
20 p.
article
661 Robustness among multiwinner voting rules Bredereck, Robert

182-183 C p.
article
662 Robust planning with incomplete domain models Nguyen, Tuan
2017
182-183 C p. 134-161
28 p.
article
663 Safe inductions and their applications in knowledge representation Bogaerts, Bart
2018
182-183 C p. 167-185
article
664 SAT-based explicit LTL f satisfiability checking Li, Jianwen

182-183 C p.
article
665 SAT-based MaxSAT algorithms Ansótegui, Carlos
2013
182-183 C p. 77-105
29 p.
article
666 SATenstein: Automatically building local search SAT solvers from components KhudaBukhsh, Ashiqur R.
2016
182-183 C p. 20-42
23 p.
article
667 SAT Race 2015 Balyo, Tomáš
2016
182-183 C p. 45-65
21 p.
article
668 Scalable constraint-based virtual data center allocation Bayless, Sam

182-183 C p.
article
669 Scalable transfer learning in heterogeneous, dynamic environments Nguyen, Trung Thanh
2017
182-183 C p. 70-94
25 p.
article
670 Second-order propositional modal logic: Expressiveness and completeness results Belardinelli, Francesco
2018
182-183 C p. 3-45
article
671 Selecting goals in oversubscription planning using relaxed plans García-Olaya, Angel

182-183 C p.
article
672 Semantical considerations on multiagent only knowing Belle, Vaishak
2015
182-183 C p. 1-26
26 p.
article
673 Semantic-based regularization for learning and inference Diligenti, Michelangelo
2017
182-183 C p. 143-165
23 p.
article
674 Semantic characterization of rational closure: From propositional logic to description logics Giordano, L.
2015
182-183 C p. 1-33
33 p.
article
675 Semantic sensitive tensor factorization Nakatsuji, Makoto
2016
182-183 C p. 224-245
22 p.
article
676 Semi-equilibrium models for paracoherent answer set programs Amendola, Giovanni
2016
182-183 C p. 219-271
53 p.
article
677 Semi-supervised combination of experts for aerosol optical depth estimation Djuric, Nemanja
2016
182-183 C p. 1-13
13 p.
article
678 Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework van der Zander, Benito
2019
182-183 C p. 1-40
article
679 Sequential plan recognition: An iterative approach to disambiguating between hypotheses Mirsky, Reuth
2018
182-183 C p. 51-73
article
680 Shielded base contraction Garapa, Marco
2018
182-183 C p. 186-216
article
681 Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems Ugarte, Willy
2017
182-183 C p. 48-69
22 p.
article
682 Smooth sparse coding via marginal regression for learning sparse representations Balasubramanian, Krishnakumar
2016
182-183 C p. 83-95
13 p.
article
683 Solving problems by formula manipulation in logic and linear inequalities Hodes, Louis
1972
182-183 C p. 165-174
10 p.
article
684 Solving QBF with counterexample guided refinement Janota, Mikoláš
2016
182-183 C p. 1-25
25 p.
article
685 So, what exactly is a qualitative calculus? Inants, Armen

182-183 C p.
article
686 Spatial reasoning with RCC 8 and connectedness constraints in Euclidean spaces Kontchakov, Roman
2014
182-183 C p. 43-75
33 p.
article
687 Spatiotemporal recursive hyperspheric classification with an application to dynamic gesture recognition Reed, Salyer B.
2019
182-183 C p. 41-66
article
688 Special issue on autonomous agents modelling other agents: Guest editorial Albrecht, Stefano V.

182-183 C p.
article
689 Speech understanding systems Newell, A.
1972
182-183 C p. 291-
1 p.
article
690 Speeding up many-objective optimization by Monte Carlo approximations Bringmann, Karl
2013
182-183 C p. 22-29
8 p.
article
691 Speeding up operations on feature terms using constraint programming and variable symmetry Ontañón, Santiago
2015
182-183 C p. 104-120
17 p.
article
692 Star-topology decoupled state space search Gnad, Daniel
2018
182-183 C p. 24-60
article
693 State space search nogood learning: Online refinement of critical-path dead-end detectors in planning Steinmetz, Marcel
2017
182-183 C p. 1-37
37 p.
article
694 Story embedding: Learning distributed representations of stories based on character networks Lee, O-Joun

182-183 C p.
article
695 STR3: A path-optimal filtering algorithm for table constraints Lecoutre, Christophe
2015
182-183 C p. 1-27
27 p.
article
696 Strategy construction using homomorphisms between games Banerji, R.B
1972
182-183 C p. 223-249
27 p.
article
697 Strategyproof matching with regional minimum and maximum quotas Goto, Masahiro
2016
182-183 C p. 40-57
18 p.
article
698 Strategyproof peer selection using randomization, partitioning, and apportionment Aziz, Haris
2019
182-183 C p. 295-309
article
699 Strategy-proof school choice mechanisms with minimum quotas and initial endowments Hamada, Naoto
2017
182-183 C p. 47-71
25 p.
article
700 Strong inconsistency Brewka, Gerhard
2019
182-183 C p. 78-117
article
701 Strong temporal planning with uncontrollable durations Cimatti, Alessandro
2018
182-183 C p. 1-34
article
702 Structured learning modulo theories Teso, Stefano
2017
182-183 C p. 166-187
22 p.
article
703 Subdimensional expansion for multirobot path planning Wagner, Glenn
2015
182-183 C p. 1-24
24 p.
article
704 Supervised heterogeneous feature transfer via random forests Sukhija, Sanatan
2019
182-183 C p. 30-53
article
705 Swarm intelligence for self-organized clustering Thrun, Michael C.

182-183 C p.
article
706 Symbolic perimeter abstraction heuristics for cost-optimal planning Torralba, Álvaro
2018
182-183 C p. 1-31
article
707 Synchronous bidirectional inference for neural sequence generation Zhang, Jiajun

182-183 C p.
article
708 Syntax-aware entity representations for neural relation extraction He, Zhengqiu
2019
182-183 C p. 602-617
article
709 Taking account of the actions of others in value-based reasoning Atkinson, Katie
2018
182-183 C p. 1-20
20 p.
article
710 Teaching and leading an ad hoc teammate: Collaboration without pre-coordination Stone, Peter
2013
182-183 C p. 35-65
31 p.
article
711 Temporally and spatially flexible plan execution for dynamic hybrid systems Hofmann, Andreas G.
2017
182-183 C p. 266-294
29 p.
article
712 The actorʼs view of automated planning and acting: A position paper Ghallab, Malik
2014
182-183 C p. 1-17
17 p.
article
713 The algorithm selection competitions 2015 and 2017 Lindauer, Marius
2019
182-183 C p. 86-100
article
714 The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) Pulina, Luca
2019
182-183 C p. 224-248
article
715 The complexity and generality of learning answer set programs Law, Mark
2018
182-183 C p. 110-146
article
716 The complexity landscape of decompositional parameters for ILP Ganian, Robert
2018
182-183 C p. 61-71
article
717 The complexity of Bayesian networks specified by propositional and relational languages Cozman, Fabio G.

182-183 C p. 96-141
article
718 The complexity of decision problems about equilibria in two-player Boolean games Ianovski, Egor
2018
182-183 C p. 1-15
article
719 The complexity of exact learning of acyclic conditional preference networks from swap examples Alanazi, Eisa

182-183 C p.
article
720 The complexity of manipulative attacks in nearly single-peaked electorates Faliszewski, Piotr
2014
182-183 C p. 69-99
31 p.
article
721 The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions Fionda, Valeria
2013
182-183 C p. 1-25
25 p.
article
722 The complexity of reasoning with FODD and GFODD Hescott, Benjamin J.
2015
182-183 C p. 1-32
32 p.
article
723 The Configurable SAT Solver Challenge (CSSC) Hutter, Frank
2017
182-183 C p. 1-25
25 p.
article
724 The co-occurrence test for non-monotonic inference Hansson, Sven Ove
2016
182-183 C p. 190-195
6 p.
article
725 The deterministic part of the seventh International Planning Competition Linares López, Carlos
2015
182-183 C p. 82-119
38 p.
article
726 The distortion of distributed voting Filos-Ratsikas, Aris

182-183 C p.
article
727 The dropout learning algorithm Baldi, Pierre
2014
182-183 C p. 78-122
45 p.
article
728 The first international competition on computational models of argumentation: Results and analysis Thimm, Matthias
2017
182-183 C p. 267-294
28 p.
article
729 The increasing cost tree search for optimal multi-agent pathfinding Sharon, Guni
2013
182-183 C p. 470-495
26 p.
article
730 The influence of k-dependence on the complexity of planning Giménez, Omer
2012
182-183 C p. 25-45
21 p.
article
731 The International Joint Conference on Artificial Intelligence (IJCAI) 1972
182-183 C p. 289-290
2 p.
article
732 The limits of decidability in fuzzy description logics with general concept inclusions Borgwardt, Stefan
2015
182-183 C p. 23-55
33 p.
article
733 The logic of gossiping van Ditmarsch, Hans

182-183 C p.
article
734 The logic of qualitative probability Delgrande, James P.
2019
182-183 C p. 457-486
article
735 The MADLA planner: Multi-agent planning by combination of distributed and local heuristic search Štolba, Michal
2017
182-183 C p. 175-210
36 p.
article
736 The multifaceted impact of Ada Lovelace in the digital age Carlucci Aiello, Luigia
2016
182-183 C p. 58-62
5 p.
article
737 The price of query rewriting in ontology-based data access Gottlob, Georg
2014
182-183 C p. 42-59
18 p.
article
738 The QBF Gallery: Behind the scenes Lonsing, Florian
2016
182-183 C p. 92-114
23 p.
article
739 The scope and limits of simulation in automated reasoning Davis, Ernest
2016
182-183 C p. 60-72
13 p.
article
740 The technology chess program Gillogly, James J
1972
182-183 C p. 145-163
19 p.
article
741 The unbiased black-box complexity of partition is polynomial Doerr, Benjamin
2014
182-183 C p. 275-286
12 p.
article
742 The virtues of idleness: A decidable fragment of resource agent logic Alechina, Natasha
2017
182-183 C p. 56-85
30 p.
article
743 Thick set inversion Desrochers, B.
2017
182-183 C p. 1-18
18 p.
article
744 Three-valued semantics for hybrid MKNF knowledge bases revisited Liu, Fangfang
2017
182-183 C p. 123-138
16 p.
article
745 Together we know how to achieve: An epistemic logic of know-how Naumov, Pavel

182-183 C p. 279-300
article
746 Topic-based term translation models for statistical machine translation Xiong, Deyi
2016
182-183 C p. 54-75
22 p.
article
747 Toward any-language zero-shot topic classification of textual documents Song, Yangqiu
2019
182-183 C p. 133-150
article
748 Towards a science of integrated AI and Robotics Rajan, Kanna
2017
182-183 C p. 1-9
9 p.
article
749 Towards breaking more composition symmetries in partial symmetry breaking Lee, Jimmy H.M.
2017
182-183 C p. 51-82
32 p.
article
750 Towards fixed-parameter tractable algorithms for abstract argumentation Dvořák, Wolfgang
2012
182-183 C p. 1-37
37 p.
article
751 Towards mobile intelligence: Learning from GPS history data for collaborative recommendation Zheng, Vincent W.
2012
182-183 C p. 17-37
21 p.
article
752 Towards more expressive ontology languages: The query answering problem Cali`, Andrea
2012
182-183 C p. 87-128
42 p.
article
753 Tractability-preserving transformations of global cost functions Allouche, David
2016
182-183 C p. 166-189
24 p.
article
754 Tractable approximate deduction for OWL Pan, Jeff Z.
2016
182-183 C p. 95-155
61 p.
article
755 Train-O-Matic: Supervised Word Sense Disambiguation with no (manual) effort Pasini, Tommaso

182-183 C p.
article
756 Transfer learning in heterogeneous collaborative filtering domains Pan, Weike
2013
182-183 C p. 39-55
17 p.
article
757 Transferring knowledge as heuristics in reinforcement learning: A case-based approach Bianchi, Reinaldo A.C.
2015
182-183 C p. 102-121
20 p.
article
758 Transferring skills to humanoid robots by extracting semantic representations from observations of human activities Ramirez-Amaro, Karinne
2017
182-183 C p. 95-118
24 p.
article
759 Truncated incremental search Aine, Sandip
2016
182-183 C p. 49-77
29 p.
article
760 Truthful learning mechanisms for multi-slot sponsored search auctions with externalities Gatti, Nicola
2015
182-183 C p. 93-139
47 p.
article
761 Turing-like indistinguishability tests for the validation of a computer simulation of paranoid processes Colby, Kenneth Mark
1972
182-183 C p. 199-221
23 p.
article
762 Type Extension Trees for feature construction and learning in relational domains Jaeger, Manfred
2013
182-183 C p. 30-55
26 p.
article
763 Łukasiewicz logics for cooperative games Marchioni, Enrico
2019
182-183 C p. 252-278
article
764 Understanding the complexity of axiom pinpointing in lightweight description logics Peñaloza, Rafael
2017
182-183 C p. 80-104
25 p.
article
765 Understanding the power of Max-SAT resolution through UP-resilience Cherif, Mohamed Sami

182-183 C p.
article
766 Unsupervised human activity analysis for intelligent mobile robots Duckworth, Paul
2019
182-183 C p. 67-92
article
767 Utilitarian welfare and representation guarantees of approval-based multiwinner rules Lackner, Martin

182-183 C p.
article
768 Variable neighborhood search for graphical model energy minimization Ouali, Abdelkader

182-183 C p.
article
769 Variable symmetry breaking in numerical constraint problems Goldsztejn, Alexandre
2015
182-183 C p. 105-125
21 p.
article
770 Verification in incomplete argumentation frameworks Baumeister, Dorothea
2018
182-183 C p. 1-26
article
771 Verification of multi-agent systems with public actions against strategy logic Belardinelli, Francesco

182-183 C p.
article
772 Vicious circle principle, aggregates, and formation of sets in ASP based languages Gelfond, Michael
2019
182-183 C p. 28-77
article
773 Voting on multi-issue domains with conditionally lexicographic preferences Lang, Jérôme
2018
182-183 C p. 18-44
article
774 Voting rules as error-correcting codes Procaccia, Ariel D.
2016
182-183 C p. 1-16
16 p.
article
775 Wanted: Collaborative intelligence Epstein, Susan L.
2015
182-183 C p. 36-45
10 p.
article
776 Watson: Beyond Jeopardy! Ferrucci, David
2013
182-183 C p. 93-105
13 p.
article
777 Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents Liemhetcharat, Somchaya
2014
182-183 C p. 41-65
25 p.
article
778 When security games hit traffic: A deployed optimal traffic enforcement system Rosenfeld, Ariel

182-183 C p.
article
779 WPM3: An (in)complete algorithm for weighted partial MaxSAT Ansótegui, Carlos
2017
182-183 C p. 37-57
21 p.
article
780 X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs Vedder, Kyle

182-183 C p.
article
                             780 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands