Search the dblp DataBase
Lenhart K. Schubert :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Lenhart K. Schubert , Mary Angela Papalaskaris , Jay Taugher Determining Type, Part, Color and Time Relationships. [Citation Graph (3, 0)][DBLP ] IEEE Computer, 1983, v:16, n:10, pp:53-60 [Journal ] Lenhart K. Schubert Extending the Expressive Power of Semantic Networks. [Citation Graph (2, 0)][DBLP ] Artif. Intell., 1976, v:7, n:2, pp:163-198 [Journal ] Stephanie A. Miller , Lenhart K. Schubert Using Specialists to Accelerate General Reasoning. [Citation Graph (1, 0)][DBLP ] AAAI, 1988, pp:161-165 [Conf ] Alfonso Gerevini , Lenhart K. Schubert Discovering State Constraints in DISCOPLAN: Some New Results. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2000, pp:761-767 [Conf ] Alfonso Gerevini , Lenhart K. Schubert Inferring State Constraints for Domain-Independent Planning. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 1998, pp:905-912 [Conf ] Johannes de Haan , Lenhart K. Schubert Inference in a Topically Organized Semantic Net. [Citation Graph (0, 0)][DBLP ] AAAI, 1986, pp:334-338 [Conf ] Chung Hee Hwang , Lenhart K. Schubert EL: A Formal, Yet Natural, Comprehensive Knowledge Representation. [Citation Graph (0, 0)][DBLP ] AAAI, 1993, pp:676-682 [Conf ] Lenhart K. Schubert Turing's Dream and the Knowledge Challenge. [Citation Graph (0, 0)][DBLP ] AAAI, 2006, pp:- [Conf ] Lenhart K. Schubert Are There Preference Trade-offs in Attachment Decisions? [Citation Graph (0, 0)][DBLP ] AAAI, 1986, pp:601-605 [Conf ] Mark G. Core , Lenhart K. Schubert A Syntactic Framework for Speech Repairs and Other Disruptions. [Citation Graph (0, 0)][DBLP ] ACL, 1999, pp:- [Conf ] Chung Hee Hwang , Lenhart K. Schubert Tense Trees as the "Fine Structure" of Discourse. [Citation Graph (0, 0)][DBLP ] ACL, 1992, pp:232-240 [Conf ] Alfonso Gerevini , Lenhart K. Schubert Computing Parameter Domains as an Aid to Planning. [Citation Graph (0, 0)][DBLP ] AIPS, 1996, pp:94-101 [Conf ] Proshanto Mukherji , Lenhart K. Schubert Discovering Planning Invariants as Anomalies in State Descriptions. [Citation Graph (0, 0)][DBLP ] ICAPS, 2005, pp:223-230 [Conf ] Francis Jeffry Pelletier , Lenhart K. Schubert Two Theories For Computing The Logical Form Of Mass Expressions. [Citation Graph (0, 0)][DBLP ] COLING, 1984, pp:108-111 [Conf ] Lenhart K. Schubert On Parsing Preferences. [Citation Graph (0, 0)][DBLP ] COLING, 1984, pp:247-250 [Conf ] Cao An Wang , Lenhart K. Schubert An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1987, pp:223-232 [Conf ] Mark G. Core , Lenhart K. Schubert Implementing Parser Metarules that Handle Speech Repairs and Other Disruptions. [Citation Graph (0, 0)][DBLP ] FLAIRS Conference, 1998, pp:283-288 [Conf ] Lenhart K. Schubert , Proshanto Mukherji State-based Discovery and Verification of Propositional Planning Invariants. [Citation Graph (0, 0)][DBLP ] IC-AI, 2006, pp:465-471 [Conf ] Alfonso Gerevini , Lenhart K. Schubert , Stephanie Schaeffer The Temporal Reasoning Tools TimeGraph I-II. [Citation Graph (0, 0)][DBLP ] ICTAI, 1994, pp:513-520 [Conf ] Chung Hee Hwang , Lenhart K. Schubert Interpreting Tense, Aspect and Time Adverbials: A Compositional, Unified Approach. [Citation Graph (0, 0)][DBLP ] ICTL, 1994, pp:238-264 [Conf ] Nick Cercone , Lenhart K. Schubert Toward a State Based Conceptual Representation. [Citation Graph (0, 0)][DBLP ] IJCAI, 1975, pp:83-90 [Conf ] Alfonso Gerevini , Lenhart K. Schubert Efficient Temporal Reasoning through Timegraphs. [Citation Graph (0, 0)][DBLP ] IJCAI, 1993, pp:648-654 [Conf ] Chung Hee Hwang , Lenhart K. Schubert Meeting the Interlocking Needs of LF-Computation Deindexing and Inference: An Organic Approach to General NLU. [Citation Graph (0, 0)][DBLP ] IJCAI, 1993, pp:1297-1303 [Conf ] Mary Angela Papalaskaris , Lenhart K. Schubert PARTS INFERENCE: Closed and Semi-Closed Partitioning Graphs. [Citation Graph (0, 0)][DBLP ] IJCAI, 1981, pp:304-309 [Conf ] Lenhart K. Schubert Iterated Limiting Recursion and the Program Minimization Problem. [Citation Graph (0, 0)][DBLP ] IJCAI, 1973, pp:513-523 [Conf ] Lenhart K. Schubert Extending The Expressive Power Of Semantic Networks. [Citation Graph (0, 0)][DBLP ] IJCAI, 1975, pp:158-164 [Conf ] Alfonso Gerevini , Lenhart K. Schubert An Efficient Method for Managing Disjunctions in Qualitative Temporal Reasoning. [Citation Graph (0, 0)][DBLP ] KR, 1994, pp:214-225 [Conf ] Lenhart K. Schubert , Chung Hee Hwang An Episodic Knowledge Representation for Narrative Texts. [Citation Graph (0, 0)][DBLP ] KR, 1989, pp:444-458 [Conf ] Lenhart K. Schubert Implementations and Research: Discussions at the Boundary. [Citation Graph (0, 0)][DBLP ] KR, 1996, pp:661-662 [Conf ] Lenhart K. Schubert Exploiting Natural Language for Knowledge Representation and Reasoning (Abstract). [Citation Graph (0, 0)][DBLP ] KR, 1994, pp:650-651 [Conf ] Lenhart K. Schubert Some KR&R requirements for self-awareness. [Citation Graph (0, 0)][DBLP ] Metacognition in Computation, 2005, pp:106-113 [Conf ] James F. Allen , Lenhart K. Schubert Natural Language Planning Dialogue for Interactive. [Citation Graph (0, 0)][DBLP ] HLT, 1994, pp:- [Conf ] James F. Allen , Lenhart K. Schubert Natural Language, Knowledge Representation and Discourse. [Citation Graph (0, 0)][DBLP ] HLT, 1991, pp:- [Conf ] Alfonso Gerevini , Lenhart K. Schubert On Point-Based Temporal Disjointness. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1994, v:70, n:1-2, pp:347-361 [Journal ] Alfonso Gerevini , Lenhart K. Schubert Efficient Algorithms for Qualitative Reasoning about Time. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1995, v:74, n:2, pp:207-248 [Journal ] Aaron N. Kaplan , Lenhart K. Schubert A computational model of belief. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2000, v:120, n:1, pp:119-160 [Journal ] Alfonso Gerevini , Lenhart K. Schubert On Computing the Minimal Labels in Time Point Algebra Networks. [Citation Graph (0, 0)][DBLP ] Computational Intelligence, 1995, v:11, n:, pp:443-448 [Journal ] Stephanie A. Miller , Lenhart K. Schubert Time revisited. [Citation Graph (0, 0)][DBLP ] Computational Intelligence, 1990, v:6, n:, pp:108-118 [Journal ] Lenhart K. Schubert Cheeseman: a travesty of truth. [Citation Graph (0, 0)][DBLP ] Computational Intelligence, 1988, v:4, n:, pp:118-121 [Journal ] Lenhart K. Schubert , Francis Jeffry Pelletier From English to Logic: Context-Free Computation of `Conventional' Logical Translation. [Citation Graph (0, 0)][DBLP ] American Journal of Computational Linguistics, 1982, v:8, n:1, pp:26-44 [Journal ] Alfonso Gerevini , Lenhart K. Schubert Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning [Citation Graph (0, 0)][DBLP ] CoRR, 1996, v:0, n:, pp:- [Journal ] Lenhart K. Schubert Representative Samples of Programmable Functions [Citation Graph (0, 0)][DBLP ] Information and Control, 1974, v:25, n:1, pp:30-44 [Journal ] Lenhart K. Schubert Comments on Cherniavsky's paper "On algorithmic natural language analysis and understanding" - On Cherniavsky's man/machine distinction. [Citation Graph (0, 0)][DBLP ] Inf. Syst., 1979, v:4, n:3, pp:57-59 [Journal ] Lenhart K. Schubert Iterated Limiting Recursion and the Program Minimization Problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 1974, v:21, n:3, pp:436-445 [Journal ] Alfonso Gerevini , Lenhart K. Schubert Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 1996, v:5, n:, pp:95-137 [Journal ] Lenhart K. Schubert Explanation Closure, Action Closure and the Sandewall Test Suite for Reasoning about Change. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 1994, v:4, n:5, pp:679-700 [Journal ] Alfonso Gerevini , Lenhart K. Schubert , Stephanie Schaeffer Temporal Reasoning in Timegraph I-II. [Citation Graph (0, 0)][DBLP ] SIGART Bulletin, 1993, v:4, n:3, pp:21-25 [Journal ] Lenhart K. Schubert A New Characterization of Probabilities in Bayesian Networks. [Citation Graph (0, 0)][DBLP ] UAI, 2004, pp:495-503 [Conf ] Search in 0.033secs, Finished in 0.036secs