Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Lehmann 0001
Daniel J. Lehmann
Person information
- affiliation: Hebrew University, Department of Computer Science, Jerusalem, Israel
- affiliation (PhD 1976): University of Warwick, Coventry, UK
Other persons with the same name
- Daniel Lehmann — disambiguation page
- Daniel Lehmann 0002
![[0000-0002-4037-5152]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-4037-5152")
— Google, Munich, Germany (and 2 more) - Daniel Lehmann 0003 — KTH Royal Institute of Technology, Automatic Control Laboratory, Stockholm, Sweden (and 1 more)
- Daniel Lehmann 0004 — TU Darmstadt, SECUSO Research Group, Darmstadt, Germany
- Daniel Lehmann 0005 — University of Greifswald, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1976
[b1]Daniel J. Lehmann:
Categories for fixpoint semantics. University of Warwick, Coventry, UK, 1976
Journal Articles
- 2008
- [j36]Daniel Lehmann:
A Presentation of Quantum Logic Based on an and then Connective. J. Log. Comput. 18(1): 59-76 (2008) - 2006
- [j35]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2): 270-296 (2006) - 2005
- [j34]Gaby Hayon, Moshe Abeles, Daniel Lehmann:
A Model for Representing the Dynamics of a System of Synfire Chains. J. Comput. Neurosci. 18(1): 41-53 (2005) - 2004
- [j33]Moshe Abeles, Gaby Hayon, Daniel Lehmann:
Modeling Compositionality by Dynamic Binding of Synfire Chains. J. Comput. Neurosci. 17(2): 179-201 (2004) - 2003
- [j32]Pedrito Maynard-Zhang, Daniel Lehmann:
Representing and Aggregating Conflicting Beliefs. J. Artif. Intell. Res. 19: 155-203 (2003) - 2002
- [j31]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5): 577-602 (2002) - 2001
- [j30]Daniel Lehmann:
Expected Qualitative Utility Maximization. Games Econ. Behav. 35(1-2): 54-79 (2001) - [j29]Daniel Lehmann, Menachem Magidor, Karl Schlechta:
Distance Semantics for Belief Revision. J. Symb. Log. 66(1): 295-317 (2001) - [j28]Daniel Lehmann:
Nonmonotonic Logics and Semantics. J. Log. Comput. 11(2): 229-256 (2001) - 1999
- [j27]Claudia V. Goldman, Dan Gang, Jeffrey S. Rosenschein, Daniel Lehmann:
NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge. Ann. Math. Artif. Intell. 25(1-2): 69-90 (1999) - [j26]Shai Berger, Daniel Lehmann, Karl Schlechta:
Preferred History Semantics for Iterated Updates. J. Log. Comput. 9(6): 817-833 (1999) - 1998
- [j25]Elie Bienenstock, Daniel Lehmann:
Regulated Criticality in the Brain? Adv. Complex Syst. 1(4): 361- (1998) - [j24]Zippora Arzi-Gonczarowski, Daniel Lehmann:
From Environments to Representations - A Mathematical Theory of Artificial Perceptions. Artif. Intell. 102(2): 187-247 (1998) - [j23]Zippora Arzi-Gonczarowski, Daniel 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. Log. J. IGPL 6(1): 49-58 (1998) - 1996
- [j21]Michael Freund, Daniel Lehmann:
On Negation Rationality. J. Log. Comput. 6(2): 263-269 (1996) - 1995
- [j20]Daniel Lehmann:
Another Perspective on Default Reasoning. Ann. Math. Artif. Intell. 15(1): 61-82 (1995) - [j19]Sarit Kraus, Daniel Lehmann:
Designing and Building a Negotiating Automated Agent. Comput. Intell. 11: 132-171 (1995) - [j18]Yuri Kaluzhny, Daniel Lehmann:
Deductive Nonmonotonic Inference Operations: Antitonic Representations. J. Log. Comput. 5(1): 111-122 (1995) - 1994
- [j17]Michael Freund, Daniel Lehmann:
Nonmonotonic reasoning: from finitary relations to infinitary inference operations. Stud Logica 53(2): 161-202 (1994) - 1993
- [j16]Michael Freund, Daniel Lehmann:
Nonmonotonic inference operations. Log. J. IGPL 1(1): 23-68 (1993) - 1992
- [j15]Michael Freund, Daniel Lehmann, Paul Morris:
Rationality, Transitivity, and Contraposition. Artif. Intell. 52(2): 191-203 (1992) - [j14]Daniel Lehmann, Menachem Magidor:
What does a Conditional Knowledge Base Entail? Artif. Intell. 55(1): 1-60 (1992) - 1991
- [j13]Sarit Kraus, Eithan Ephrati, Daniel Lehmann:
Negotiation in a non-cooperative environment. J. Exp. Theor. Artif. Intell. 3(4): 255-281 (1991) - 1990
- [j12]Sarit Kraus, Daniel Lehmann, Menachem Magidor:
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. Artif. Intell. 44(1-2): 167-207 (1990) - 1988
- [j11]Sarit Kraus, Daniel Lehmann:
Knowledge, Belief and Time. Theor. Comput. Sci. 58: 155-174 (1988) - 1984
- [j10]Nissim Francez, Daniel Lehmann, Amir Pnueli:
A Linear-History Semantics for Languages for Distributed Programming. Theor. Comput. Sci. 32: 25-46 (1984) - [j9]Shimon Cohen, Daniel Lehmann, Amir Pnueli:
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System. Theor. Comput. Sci. 34: 215-225 (1984) - 1982
- [j8]Daniel Lehmann, Saharon Shelah:
Reasoning with Time and Chance. Inf. Control. 53(3): 165-198 (1982) - [j7]Daniel J. Lehmann:
On Primality Tests. SIAM J. Comput. 11(2): 374-375 (1982) - [j6]Daniel Lehmann, Ana Pasztor:
Epis need not be Dense. Theor. Comput. Sci. 17: 151-161 (1982) - 1981
- [j5]Daniel Lehmann, Michael B. Smyth:
Algebraic Specification of Data Types: A Synthetic Approach. Math. Syst. Theory 14: 97-139 (1981) - 1980
- [j4]Daniel J. Lehmann:
On the Algebra of Order. J. Comput. Syst. Sci. 21(1): 1-23 (1980) - 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) - 1977
- [j2]Daniel J. Lehmann:
Algebraic Structures for Transitive Closure. Theor. Comput. Sci. 4(1): 59-76 (1977) - [j1]Daniel J. Lehmann:
A Note on Schnorr's Separatedness. Theor. Comput. Sci. 4(2): 235 (1977)
Conference and Workshop Papers
- 2009
- [c38]Daniel Lehmann:
Classes of Service under Perfect Competition and Technological Change. Languages: From Formal to Natural 2009: 148-169 - [c37]Daniel Lehmann:
Foundations of non-commutative probability theory. TARK 2009: 193-200 - 2008
- [c36]Daniel Lehmann:
Connectives in Cumulative Logics. Pillars of Computer Science 2008: 424-440 - 2007
- [c35]Daniel Lehmann:
INVITED: A Presentation of Quantum Logic based on an and then connective. AAAI Spring Symposium: Quantum Interaction 2007: 24-30 - 2005
- [c34]Amir Ronen, Daniel Lehmann:
Nearly optimal multi attribute auctions. EC 2005: 279-285 - 2004
- [c33]Meir Bing, Daniel Lehmann, Paul Milgrom:
Presentation and structure of substitutes valuations. EC 2004: 238-239 - 2001
- [c32]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial auctions with decreasing marginal utilities. EC 2001: 18-28 - [c31]Daniel J. Lehmann:
Classes of service under perfect competition and technological change: A model for the dynamics of the internet? EC 2001: 191-193 - 2000
- [c30]Pedrito Maynard-Reid II, Daniel Lehmann:
Representing and Aggregating Conflicting Beliefs. KR 2000: 153-164 - [c29]Rica Gonen, Daniel Lehmann:
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics. EC 2000: 13-20 - 1999
- [c28]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth revelation in approximately efficient combinatorial auctions. EC 1999: 96-102 - 1998
- [c27]Dan Gang, Daniel Lehmann, Naftali Wagner:
Tuning a Neural Network for Harmonizing Melodies in Real-Time. ICMC 1998 - [c26]Daniel Lehmann:
Nonstandard Numbers for Qualitative Decision Making. TARK 1998: 161-174 - 1997
- [c25]Dan Gang, Daniel Lehmann, Naftali Wagner:
Harmonizing Melodies in Real-Time: the Connectionist Approach. ICMC 1997 - 1996
- [c24]Claudia V. Goldman, Dan Gang, Jeffrey S. Rosenschein, Daniel Lehmann:
NetNeg: A Hybrid Interactive Architecture for Composing Polyphonic Music in Real Time. ICMC 1996 - [c23]Karl Schlechta, Daniel Lehmann, Menachem Magidor:
Distance Semantics for Belief Revision. TARK 1996: 137-145 - [c22]Daniel Lehmann:
Generalized Qualitative Probability: Savage revisited. UAI 1996: 381-388 - 1995
- [c21]Dan Gang, Daniel Lehmann:
An Artificial Neural Net for Harmonizing Melodies. ICMC 1995 - [c20]Daniel Lehmann:
Belief Revision, Revised. IJCAI 1995: 1534-1540 - [c19]Daniel Lehmann:
Ranked Structures in Nonmonotonic Reasoning and Belief Revision: Abstract. MFCS 1995: 93 - 1994
- [c18]Zippora Arzi-Gonczarowski, Daniel Lehmann:
Categorical Tools for Artificial Perception. ECAI 1994: 757-761 - 1991
- [c17]Daniel Lehmann:
Plausibility Logic. CSL 1991: 227-241 - 1990
- [c16]Michael Freund, Daniel Lehmann:
Deductive Inference Operations. JELIA 1990: 227-233 - [c15]Daniel Lehmann, Menachem Magidor:
Preferential Logics: the Predicate Calculus Case. TARK 1990: 57-72 - 1989
- [c14]Daniel Lehmann:
What Does a Conditional Knowledge Base Entail? KR 1989: 212-222 - 1988
- [c13]Craig Gotsman, Eli Shamir, Daniel Lehmann:
Asynchronous dynamics of random Boolean networks. ICNN 1988: 1-7 - 1986
- [c12]Sarit Kraus, Daniel Lehmann:
Knowledge, Belief and Time. ICALP 1986: 186-195 - 1984
- [c11]Daniel Lehmann:
Knowledge, Common Knowledge and related puzzles (Extended Summary). PODC 1984: 62-67 - 1983
- [c10]Sarit Kraus, Daniel Lehmann:
Decision Procedures for Time and Chance (Extended Abstract). FOCS 1983: 202-209 - [c9]Shimon Cohen, Daniel Lehmann, Amir Pnueli:
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract). ICALP 1983: 128-136 - [c8]Daniel Lehmann, Saharon Shelah:
Reasoning with Time and Chance (Extended Abstract). ICALP 1983: 445-457 - 1982
- [c7]Shimon Cohen, Daniel Lehmann:
Dynamic Systems and Their Distributed Termination. PODC 1982: 29-33 - 1981
- [c6]Daniel Lehmann, Amir Pnueli, Jonathan Stavi:
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. ICALP 1981: 264-277 - [c5]Daniel 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
- [c4]Nissim Francez, Daniel Lehmann, Amir Pnueli:
A Linear History Semantics for Distributed Languages (Extended Abstract). FOCS 1980: 143-151 - 1978
- [c3]Daniel J. Lehmann:
On the Algebra of Order (Extended Abstract). FOCS 1978: 214-220 - 1977
- [c2]Daniel Lehmann, Michael B. Smyth:
Data Types (Extended Abstract). FOCS 1977: 7-12 - 1976
- [c1]Daniel J. Lehmann:
Categories for Fixpoint-Semantics. FOCS 1976: 122-126
Editorship
- 2005
- [e1]Daniel Lehmann, Rudolf Müller, Tuomas Sandholm:
Computing and Markets, 3.-7. January 2005. Dagstuhl Seminar Proceedings 05011, IBFI, Schloss Dagstuhl, Germany 2005 [contents]
Informal and Other Publications
- 2021
- [i33]Daniel Lehmann:
Representing choice functions by a total hyper-order. CoRR abs/2107.02798 (2021) - 2019
- [i32]Daniel Lehmann:
Revealed Preferences for Matching with Contracts. CoRR abs/1908.08823 (2019) - 2018
- [i31]Daniel Lehmann:
Local Equilibria. CoRR abs/1807.00304 (2018) - 2017
- [i30]Daniel Lehmann:
Ultra valuations. CoRR abs/1712.04236 (2017) - 2014
- [i29]Daniel Lehmann:
Generalized Qualitative Probability: Savage Revisited. CoRR abs/1408.1481 (2014) - 2007
- [i28]Daniel Lehmann:
A presentation of Quantum Logic based on an "and then" connective. CoRR abs/quant-ph/0701113 (2007) - 2005
- [i27]Daniel Lehmann, Rudolf Müller, Tuomas Sandholm:
05011 Executive Summary - Computing and Markets. Computing and Markets 2005 - [i26]Daniel Lehmann, Rudolf Müller, Tuomas Sandholm:
05011 Abstracts Collection - Computing and Markets. Computing and Markets 2005 - [i25]Daniel Lehmann, Kurt Engesser, Dov M. Gabbay:
Algebras of Measurements: the logical structure of Quantum Mechanics. CoRR abs/quant-ph/0507231 (2005) - 2002
- [i24]Daniel Lehmann:
Nonmonotonic Logics and Semantics. CoRR cs.AI/0202018 (2002) - [i23]Sarit Kraus, Daniel Lehmann, Menachem Magidor:
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics. CoRR cs.AI/0202021 (2002) - [i22]Daniel Lehmann, Menachem Magidor:
What does a conditional knowledge base entail? CoRR cs.AI/0202022 (2002) - [i21]Daniel Lehmann:
A note on Darwiche and Pearl. CoRR cs.AI/0202024 (2002) - [i20]Daniel Lehmann, Menachem Magidor, Karl Schlechta:
Distance Semantics for Belief Revision. CoRR cs.AI/0202025 (2002) - [i19]Shai Berger, Daniel Lehmann, Karl Schlechta:
Preferred History Semantics for Iterated Updates. CoRR cs.AI/0202026 (2002) - [i18]Michael Freund, Daniel Lehmann:
Nonmonotonic inference operations. CoRR cs.AI/0202031 (2002) - [i17]Daniel Lehmann:
The logical meaning of Expansion. CoRR cs.AI/0202033 (2002) - [i16]Daniel Lehmann:
Another perspective on Default Reasoning. CoRR cs.AI/0203002 (2002) - [i15]Yuri Kaluzhny, Daniel Lehmann:
Deductive Nonmonotonic Inference Operations: Antitonic Representations. CoRR cs.AI/0203003 (2002) - [i14]Daniel Lehmann:
Stereotypical Reasoning: Logical Properties. CoRR cs.AI/0203004 (2002) - [i13]Pedrito Maynard-Reid II, Daniel Lehmann:
Representing and Aggregating Conflicting Beliefs. CoRR cs.AI/0203013 (2002) - [i12]Claudia V. Goldman, Dan Gang, Jeffrey S. Rosenschein, Daniel Lehmann:
NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge. CoRR cs.AI/0203021 (2002) - [i11]Michael Freund, Daniel Lehmann:
Belief Revision and Rational Inference. CoRR cs.AI/0204032 (2002) - [i10]Daniel Lehmann:
Connectives in Quantum and other Cumulative Logics. CoRR cs.AI/0205079 (2002) - [i9]Benny Lehmann, Daniel Lehmann, Noam Nisan:
Combinatorial Auctions with Decreasing Marginal Utilities. CoRR cs.GT/0202015 (2002) - [i8]Rica Gonen, Daniel Lehmann:
Linear Programming helps solving large multi-unit combinatorial auctions. CoRR cs.GT/0202016 (2002) - [i7]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth Revelation in Approximately Efficient Combinatorial Auctions. CoRR cs.GT/0202017 (2002) - [i6]Daniel Lehmann:
Expected Qualitative Utility Maximization. CoRR cs.GT/0202023 (2002) - [i5]Daniel Lehmann:
Classes of service under perfect competition and technological change: a model for the dynamics of the Internet? CoRR cs.GT/0202028 (2002) - [i4]Daniel Lehmann:
Nonstandard numbers for qualitative decision making. CoRR cs.GT/0202029 (2002) - [i3]Daniel Lehmann:
Generalized Qualitative Probability: Savage revisited. CoRR cs.GT/0202030 (2002) - [i2]Rica Gonen, Daniel Lehmann:
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics. CoRR cs.GT/0202032 (2002) - [i1]Elie Bienenstock, Daniel Lehmann:
Covariance Plasticity and Regulated Criticality. CoRR cs.NE/0202034 (2002)
Coauthor Index
a service of 
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:45 CEST 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:
