| 2006 | ||
|---|---|---|
| j31 | Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55(2): 270-296 (2006) | |
| 2005 | ||
| c31 | Daniel J. Lehmann, Rudolf Müller, Tuomas Sandholm: 05011 Executive Summary - Computing and Markets. Computing and Markets 2005 | |
| c30 | Daniel J. Lehmann, Rudolf Müller, Tuomas Sandholm: 05011 Abstracts Collection - Computing and Markets. Computing and Markets 2005 | |
| c29 | Amir Ronen, Daniel J. Lehmann: Nearly optimal multi attribute auctions. ACM Conference on Electronic Commerce 2005: 279-285 | |
| e1 | Daniel J. Lehmann, Rudolf Müller, Tuomas Sandholm (Eds.): Computing and Markets, 3.-7. January 2005. Dagstuhl Seminar Proceedings 05011, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 | |
| 2004 | ||
| c28 | Meir Bing, Daniel J. Lehmann, Paul Milgrom: Presentation and structure of substitutes valuations. ACM Conference on Electronic Commerce 2004: 238-239 | |
| 2003 | ||
| j30 | Pedrito Maynard-Zhang, Daniel J. Lehmann: Representing and Aggregating Conflicting Beliefs. J. Artif. Intell. Res. (JAIR) 19: 155-203 (2003) | |
| 2002 | ||
| j29 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5): 577-602 (2002) | |
| i24 | ||
| i23 | Sarit Kraus, Daniel J. Lehmann, Menachem Magidor: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. CoRR cs.AI/0202021 (2002) | |
| i22 | Daniel J. Lehmann, Menachem Magidor: What does a conditional knowledge base entail? CoRR cs.AI/0202022 (2002) | |
| i21 | ||
| i20 | Daniel J. Lehmann, Menachem Magidor, Karl Schlechta: Distance Semantics for Belief Revision. CoRR cs.AI/0202025 (2002) | |
| i19 | Shai Berger, Daniel J. Lehmann, Karl Schlechta: Preferred History Semantics for Iterated Updates. CoRR cs.AI/0202026 (2002) | |
| i18 | ||
| i17 | ||
| i16 | ||
| i15 | Yuri Kaluzhny, Daniel J. Lehmann: Deductive Nonmonotonic Inference Operations: Antitonic Representations. CoRR cs.AI/0203003 (2002) | |
| i14 | ||
| i13 | Pedrito Maynard-Reid II, Daniel J. Lehmann: Representing and Aggregating Conflicting Beliefs. CoRR cs.AI/0203013 (2002) | |
| i12 | Claudia V. Goldman, Dan Gang, Jeffrey S. Rosenschein, Daniel J. Lehmann: NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge. CoRR cs.AI/0203021 (2002) | |
| i11 | Michael Freund, Daniel J. Lehmann: Belief Revision and Rational Inference. CoRR cs.AI/0204032 (2002) | |
| i10 | ||
| i9 | Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial Auctions with Decreasing Marginal Utilities. CoRR cs.GT/0202015 (2002) | |
| i8 | Rica Gonen, Daniel J. Lehmann: Linear Programming helps solving large multi-unit combinatorial auctions. CoRR cs.GT/0202016 (2002) | |
| i7 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham: Truth Revelation in Approximately Efficient Combinatorial Auctions. CoRR cs.GT/0202017 (2002) | |
| i6 | ||
| i5 | Daniel J. Lehmann: Classes of service under perfect competition and technological change: a model for the dynamics of the Internet? CoRR cs.GT/0202028 (2002) | |
| i4 | ||
| i3 | ||
| i2 | Rica Gonen, Daniel J. Lehmann: Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. CoRR cs.GT/0202032 (2002) | |
| i1 | Elie Bienenstock, Daniel J. Lehmann: Covariance Plasticity and Regulated Criticality. CoRR cs.NE/0202034 (2002) | |
| 2001 | ||
| j28 | Daniel J. Lehmann, Menachem Magidor, Karl Schlechta: Distance Semantics for Belief Revision. J. Symb. Log. 66(1): 295-317 (2001) | |
| j27 | ||
| c27 | Benny Lehmann, Daniel J. Lehmann, Noam Nisan: Combinatorial auctions with decreasing marginal utilities. ACM Conference on Electronic Commerce 2001: 18-28 | |
| c26 | Daniel J. Lehmann: Classes of service under perfect competition and technological change: A model for the dynamics of the internet? ACM Conference on Electronic Commerce 2001: 191-193 | |
| 2000 | ||
| c25 | Pedrito Maynard-Reid II, Daniel J. Lehmann: Representing and Aggregating Conflicting Beliefs. KR 2000: 153-164 | |
| c24 | Rica Gonen, Daniel J. Lehmann: Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. ACM Conference on Electronic Commerce 2000: 13-20 | |
| 1999 | ||
| j26 | Claudia V. Goldman, Dan Gang, Jeffrey S. Rosenschein, Daniel J. Lehmann: NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge. Ann. Math. Artif. Intell. 25(1-2): 69-90 (1999) | |
| j25 | Shai Berger, Daniel J. Lehmann, Karl Schlechta: Preferred History Semantics for Iterated Updates. J. Log. Comput. 9(6): 817-833 (1999) | |
| c23 | Daniel J. Lehmann, Liadan O'Callaghan, Yoav Shoham: Truth revelation in approximately efficient combinatorial auctions. ACM Conference on Electronic Commerce 1999: 96-102 | |
| 1998 | ||
| j24 | Zippora Arzi-Gonczarowski, Daniel J. Lehmann: From Environments to Representations - A Mathematical Theory of Artificial Perceptions. Artif. Intell. 102(2): 187-247 (1998) | |
| j23 | Zippora Arzi-Gonczarowski, Daniel J. Lehmann: Introducing the Mathematical Category of Artificial Perceptions. Ann. Math. Artif. Intell. 23(3-4): 267-298 (1998) | |
| j22 | Daniel J. Lehmann: Stereotypical Reasoning: Logical Properties. Logic Journal of the IGPL 6(1): 49-58 (1998) | |
| c22 | ||
| 1996 | ||
| j21 | ||
| c21 | Karl Schlechta, Daniel J. Lehmann, Menachem Magidor: Distance Semantics for Belief Revision. TARK 1996: 137-145 | |
| c20 | ||
| 1995 | ||
| j20 | Daniel J. Lehmann: Another Perspective on Default Reasoning. Ann. Math. Artif. Intell. 15(1): 61-82 (1995) | |
| j19 | Sarit Kraus, Daniel J. Lehmann: Designing and Building a Negotiating Automated Agent. Computational Intelligence 11: 132-171 (1995) | |
| j18 | Yuri Kaluzhny, Daniel J. Lehmann: Deductive Nonmonotonic Inference Operations: Antitonic Representations. J. Log. Comput. 5(1): 111-122 (1995) | |
| c19 | ||
| c18 | Daniel J. Lehmann: Ranked Structures in Nonmonotonic Reasoning and Belief Revision: Abstract. MFCS 1995: 93 | |
| 1994 | ||
| j17 | Michael Freund, Daniel J. Lehmann: Nonmonotonic reasoning: from finitary relations to infinitary inference operations. Studia Logica 53(2): 161-202 (1994) | |
| c17 | Zippora Arzi-Gonczarowski, Daniel J. Lehmann: Categorical Tools for Artificial Perception. ECAI 1994: 757-761 | |
| 1993 | ||
| j16 | Michael Freund, Daniel J. Lehmann: Nonmonotonic inference operations. Logic Journal of the IGPL 1(1): 23-68 (1993) | |
| 1992 | ||
| j15 | Michael Freund, Daniel J. Lehmann, Paul Morris: Rationality, Transitivity, and Contraposition. Artif. Intell. 52(2): 191-203 (1992) | |
| j14 | Daniel J. Lehmann, Menachem Magidor: What does a Conditional Knowledge Base Entail? Artif. Intell. 55(1): 1-60 (1992) | |
| 1991 | ||
| j13 | Sarit Kraus, Eithan Ephrati, Daniel J. Lehmann: Negotiation in a non-cooperative environment. J. Exp. Theor. Artif. Intell. 3(4): 255-281 (1991) | |
| c16 | ||
| 1990 | ||
| j12 | Sarit Kraus, Daniel J. Lehmann, Menachem Magidor: Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artif. Intell. 44(1-2): 167-207 (1990) | |
| c15 | ||
| c14 | Daniel J. Lehmann, Menachem Magidor: Preferential Logics: the Predicate Calculus Case. TARK 1990: 57-72 | |
| 1989 | ||
| c13 | ||
| 1988 | ||
| j11 | ||
| 1986 | ||
| c12 | ||
| 1984 | ||
| j10 | Nissim Francez, Daniel J. Lehmann, Amir Pnueli: A Linear-History Semantics for Languages for Distributed Programming. Theor. Comput. Sci. 32: 25-46 (1984) | |
| j9 | Shimon Cohen, Daniel J. Lehmann, Amir Pnueli: Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System. Theor. Comput. Sci. 34: 215-225 (1984) | |
| c11 | Daniel J. Lehmann: Knowledge, Common Knowledge and related puzzles (Extended Summary). PODC 1984: 62-67 | |
| 1983 | ||
| c10 | Sarit Kraus, Daniel J. Lehmann: Decision Procedures for Time and Chance (Extended Abstract). FOCS 1983: 202-209 | |
| c9 | Shimon Cohen, Daniel J. Lehmann, Amir Pnueli: Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract). ICALP 1983: 128-136 | |
| c8 | Daniel J. Lehmann, Saharon Shelah: Reasoning with Time and Chance (Extended Abstract). ICALP 1983: 445-457 | |
| 1982 | ||
| j8 | Daniel J. Lehmann, Saharon Shelah: Reasoning with Time and Chance. Information and Control 53(3): 165-198 (1982) | |
| j7 | ||
| j6 | ||
| c7 | Shimon Cohen, Daniel J. Lehmann: Dynamic Systems and Their Distributed Termination. PODC 1982: 29-33 | |
| 1981 | ||
| j5 | Daniel J. Lehmann, Michael B. Smyth: Algebraic Specification of Data Types: A Synthetic Approach. Mathematical Systems Theory 14: 97-139 (1981) | |
| c6 | Daniel J. Lehmann, Amir Pnueli, Jonathan Stavi: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. ICALP 1981: 264-277 | |
| c5 | Daniel J. Lehmann, Michael O. Rabin: On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. POPL 1981: 133-138 | |
| 1980 | ||
| j4 | ||
| c4 | Nissim Francez, Daniel J. Lehmann, Amir Pnueli: A Linear History Semantics for Distributed Languages (Extended Abstract). FOCS 1980: 143-151 | |
| 1979 | ||
| j3 | Nissim Francez, C. A. R. Hoare, Daniel J. Lehmann, Willem P. de Roever: Semantics of Nondeterminism, Concurrency, and Communication. J. Comput. Syst. Sci. 19(3): 290-308 (1979) | |
| 1978 | ||
| c3 | ||
| 1977 | ||
| j2 | Daniel J. Lehmann: Algebraic Structures for Transitive Closure. Theor. Comput. Sci. 4(1): 59-76 (1977) | |
| j1 | ||
| c2 | ||
| 1976 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sat May 25 07:30:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page