default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtificial Intelligence, Volume 175
Volume 175, Number 1, January 2011
- Leora Morgenstern, Sheila A. McIlraith:
John McCarthy's legacy. 1-24 - Alfredo Gabaldon
:
Non-Markovian control in the Situation Calculus. 25-48 - Antonis C. Kakas, Loizos Michael, Rob Miller:
Modular-έ and the role of elaboration tolerance in solving the qualification problem. 49-78 - Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ricardo Morales:
Approximation of action theories and its application to conformant planning. 79-119 - Michael Thielscher:
A unifying action calculus. 120-141 - Gerhard Lakemeyer, Hector J. Levesque:
A semantic characterization of a useful fragment of the situation calculus with knowledge. 142-164 - Steven Shapiro, Maurice Pagnucco, Yves Lespérance, Hector J. Levesque:
Iterated belief change in the situation calculus. 165-192 - Afsaneh Shirazi, Eyal Amir:
First-order logical filtering. 193-219 - Joseph Y. Halpern, Riccardo Pucella:
Dealing with logical omniscience: Expressiveness and pragmatics. 220-235 - Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz:
Stable models and circumscription. 236-263 - Fangzhen Lin, Yi Zhou:
From answer set logic programming to circumscription via logic of GK. 264-277 - Wolfgang Faber, Gerald Pfeifer, Nicola Leone:
Semantics and complexity of recursive aggregates in answer set programming. 278-298 - Ernest Davis:
How does a box work? A study in the qualitative dynamics of solid objects. 299-345 - Pedro Cabalar, Paulo E. Santos:
Formalising the Fisherman's Folly puzzle. 346-377 - Fiora Pirri:
The well-designed logical robot: Learning and experience from observations to the Situation Calculus. 378-415 - Erik Sandewall:
From systems to logic in the early development of nonmonotonic reasoning. 416-427 - Johan van Benthem:
McCarthy variations in a modal key. 428-439
Volume 175, Number 2, February 2011
- Baharak Rastegari, Anne Condon, Kevin Leyton-Brown:
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions. 441-456 - Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael J. Wooldridge:
Weighted argument systems: Basic definitions, algorithms, and complexity results. 457-486 - Feng Wu, Shlomo Zilberstein, Xiaoping Chen:
Online planning for multi-agent systems with bounded communication. 487-511 - Knot Pipatsrisawat, Adnan Darwiche:
On the power of clause-learning SAT solvers as resolution engines. 512-525 - Stephanie Elzer, Sandra Carberry, Ingrid Zukerman:
The automated understanding of simple bar charts. 526-555 - Alfonso Gerevini, Alessandro Saetti:
Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure. 556-585 - Peter Nightingale:
The extended global cardinality constraint: An empirical survey. 586-614 - Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein:
A new representation and associated algorithms for generalized planning. 615-647 - Athanasios Papakonstantinou, Alex Rogers, Enrico H. Gerding, Nicholas R. Jennings:
Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems. 648-672 - Omer Qadir, Yang Jerry Liu, Gianluca Tempesti, Jon Timmis, Andy M. Tyrrell:
From Bidirectional Associative Memory to a noise-tolerant, robust Protein Processor Associative Memory. 673-693 - Vibhav Gogate, Rina Dechter:
SampleSearch: Importance sampling in presence of determinism. 694-729 - Alex Rogers, Alessandro Farinelli, Ruben Stranders, Nicholas R. Jennings:
Bounded approximate decentralised coordination via the max-sum algorithm. 730-759 - Florence Dupin de Saint-Cyr, Jérôme Lang:
Belief extrapolation (or how to reason about observations and unpredicted change). 760-790
Volume 175, Numbers 3-4, March 2011
- Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin:
On the resolution-based family of abstract argumentation semantics and its grounded instance. 791-813 - Emiliano Lorini, François Schwarzentruber:
A logic for reasoning about counterfactual emotions. 814-847 - Daniel Bryce, William Cushing, Subbarao Kambhampati:
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning. 848-889 - Yin Chen, Fangzhen Lin, Yan Zhang, Yi Zhou:
Loop-separable programs and their first-order definability. 890-913 - Yun Fan, Jing Shen:
On the phase transitions of random k-constraint satisfaction problems. 914-927
Volume 175, Numbers 5-6, April 2011
- Randy Goebel, Mary-Anne Williams:
The expansion continues: Stitching together the breadth of disciplines impinging on Artificial Intelligence. 929
- Kevin McGee:
K. Tanaka-Ishii, Semiotics of Programming. 930-931 - Peter van Beek:
David L. Poole and Alan K. Mackworth, Artificial Intelligence: Foundations of Computational Agents , Cambridge University Press (2010). 932-934 - Ashish Sabharwal, Bart Selman:
S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition. 935-937 - Peter Norvig:
Nils J. Nilsson, The Quest for Artificial Intelligence , Cambridge (2010). 938-939
- M. Ryan Calo:
Peeping Hals. 940-941 - Patrick Lin, Keith Abney, George A. Bekey:
Robot ethics: Mapping the issues for a mechanized world. 942-949 - Diane Proudfoot:
Anthropomorphism and AI: Turingʼs much misunderstood imitation game. 950-957 - Jonathan Rubin, Ian D. Watson:
Computer poker: A review. 958-987 - Hai Zhuge:
Semantic linking through spaces for cyber-physical-socio intelligence: A methodology. 988-1019 - Nick Hawes:
A survey of motivation frameworks for intelligent systems. 1020-1036
Volume 175, Numbers 7-8, May 2011
- Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, Henri Prade:
Preferences in AI: An overview. 1037-1052 - Nic Wilson:
Computational techniques for a simple theory of conditional preferences. 1053-1091 - Denis Mindolin, Jan Chomicki:
Contracting preference relations for database applications. 1092-1121 - Michael McGeachie, Jon Doyle:
The local geometry of multiattribute tradeoff preferences. 1122-1152 - Christophe Gonzales, Patrice Perny, Jean-Philippe Dubus:
Decision making with multiple objectives using GAI networks. 1153-1179 - Ronen I. Brafman:
Relational preference rules for control. 1180-1193 - Meltem Öztürk, Marc Pirlot, Alexis Tsoukiàs:
Representing preferences using intervals. 1194-1222 - Willem Waegeman, Bernard De Baets:
On the ERA ranking representability of pairwise bipartite ranking functions. 1223-1250 - Vincent Conitzer, Tuomas Sandholm:
Expressive markets for donating to charities. 1251-1271 - Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
Incompleteness and incomparability in preference aggregation: Complexity results. 1272-1289 - Fusun Yaman, Thomas J. Walsh, Michael L. Littman, Marie desJardins:
Democratic approximation of lexicographic preference models. 1290-1307 - Meghyn Bienvenu, Christian Fritz, Sheila A. McIlraith:
Specifying and computing preferred plans. 1308-1345 - Daniel Kikuti, Fábio Gagliardi Cozman, Ricardo Shirota Filho:
Sequential decision making with partially ordered preferences. 1346-1365 - Gildas Jeantet, Olivier Spanjaard:
Computing rank dependent utility in graphical models for sequential decision problems. 1366-1389 - Michael D. Moffitt:
On the modelling and optimization of preferences in constraint-based temporal reasoning. 1390-1409 - Christophe Labreuche:
A general framework for explaining the results of a multi-attribute preference model. 1410-1448 - Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten:
Preference-based English reverse auctions. 1449-1467 - Ana Casali, Lluís Godo, Carles Sierra:
A graded BDI agent model to represent and reason about preferences. 1468-1478
Volume 175, Numbers 9-10, June 2011
- Nikos Gorogiannis, Anthony Hunter:
Instantiating abstract argumentation with classical logic arguments: Postulates and properties. 1479-1497 - Karina Valdivia Delgado, Scott Sanner, Leliane Nunes de Barros:
Efficient solutions to factored MDPs with imprecise transition probabilities. 1498-1527 - Matthias Knorr, José Júlio Alferes, Pascal Hitzler:
Local closed world reasoning with description logics under the well-founded semantics. 1528-1554 - Martin C. Cooper, Stanislav Zivný:
Hybrid tractability of valued constraint problems. 1555-1569 - Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan R. Sturtevant, Zhifu Zhang:
Inconsistent heuristics in theory and practice. 1570-1603 - Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Demsar:
Learning qualitative models from numerical data. 1604-1619 - Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat:
On rules with existential variables: Walking the decidability line. 1620-1654 - Ioannis Caragiannis, Ariel D. Procaccia:
Voting almost maximizes social welfare despite limited communication. 1655-1671 - Shaowei Cai, Kaile Su, Abdul Sattar:
Local search with edge weighting and configuration checking heuristics for minimum vertex cover. 1672-1696 - David Murray-Rust, Alan Smaill:
Towards a model of musical interaction and communication. 1697-1721 - Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and complexity results for persuasive argumentation. 1722-1736 - Simone Paolo Ponzetto, Michael Strube:
Taxonomy induction based on a collaboratively built knowledge repository. 1737-1756
Volume 175, Number 11, July 2011
- Francisco S. Melo, Manuela M. Veloso:
Decentralized MDPs with sparse interactions. 1757-1789 - Bei Shui Liao, Li Jin, Robert C. Koons:
Dynamics of argumentation systems: A division-based method. 1790-1814 - Steven Schockaert, Henri Prade:
Solving conflicts in information merging by a flexible interpretation of atomic propositions. 1815-1855 - Sylvain Gelly, David Silver:
Monte-Carlo tree search and rapid action value estimation in computer Go. 1856-1875
Volume 175, Numbers 12-13, August 2011
- Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the complexity of core, kernel, and bargaining set. 1877-1910 - Gert de Cooman, Enrique Miranda, Marco Zaffalon:
Independent natural extension. 1911-1950 - Tias Guns, Siegfried Nijssen, Luc De Raedt:
Itemset mining: A constraint programming perspective. 1951-1983
Volume 175, Numbers 14-15, September 2011
- Emilia Oikarinen, Stefan Woltran:
Characterizing strong equivalence for argumentation frameworks. 1985-2009 - Pingzhong Tang, Fangzhen Lin:
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs. 2010-2020 - Sebastian Stein, Enrico H. Gerding, Alex Rogers, Kate Larson, Nicholas R. Jennings:
Algorithms and mechanisms for procuring services with uncertain durations using redundancy. 2021-2060
Volume 175, Numbers 16-17, October - November 2011
- Travis C. Service, Julie A. Adams:
Randomized coalition structure generation. 2061-2074 - Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning heuristic functions for large state spaces. 2075-2098 - Reinhard Moratz, Dominik Lücke, Till Mossakowski:
A condensed semantics for qualitative spatial reasoning about oriented straight line segments. 2099-2127
Volume 175, Number 18, December 2011
- Husain Aljazzar, Stefan Leue:
K⁎: A heuristic search algorithm for finding the k shortest paths. 2129-2154 - Weiming Liu, Sanjiang Li:
Reasoning about cardinal directions between extended objects: The NP-hardness result. 2155-2169 - Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter:
Foundations of instance level updates in expressive description logics. 2170-2197 - Saket Joshi, Kristian Kersting, Roni Khardon:
Decision-theoretic planning with generalized first-order decision diagrams. 2198-2222
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
