2003-11-25 <i>G/G/1/N</i>Queue. 545-565 1986 23 Acta Inf. 5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta23.html#Kouvatsos86 2003-11-25 Net-Based Control Versus Rational Control. The Relation Between ITNC Vector Languages and Rational Relations. 23-57 1997 34 Acta Inf. 1 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta34.html#KeesmaatK97 2003-11-25 A Logic for the Specification and Proof of Regular Controllable Processes of CCS. 507-527 1986 23 Acta Inf. 5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta23.html#GrafS86 2003-11-25 The Stability Problem of Broadcast Packet Switching Computer Networks Acta Inf. 4 1974 49-53 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta4.html#FayolleGLB74 2003-11-25 Applications of a Categorical Framework for Conceptual Data Modelling. 927-963 1997 34 Acta Inf. 12 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta34.html#HofstedeLW97 http://link.springer.de/link/service/journals/00236/bibs/7034012/70340927.htm 2003-11-25 A Formal Identification between Tuples and Lists with an Application to List-Arithmetic Categories Acta Inf. 32 1 1995 61-78 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta32.html#GuzmanOV95 2003-11-25 The Temporal Logic of Branching Time. 207-226 1983 20 Acta Inf. http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta20.html#Ben-AriPM83 2003-11-25 Attribute (Re)evaluation in OPTRAN. 213-239 1988 26 Acta Inf. 3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta26.html#LippsMOW88 2003-11-25 Transformational Design of Real-Time Systems. Part II: From Program Specifications to Programs. 67-96 1999 36 Acta Inf. 1 http://link.springer.de/link/service/journals/00236/bibs/9036001/90360067.htm http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta36.html#Schenke99 2003-11-25 Axiomatising Finite Delay Operators. 61-88 1984 21 Acta Inf. http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta21.html#Hennessy84 2003-11-25 Concurrent Testing of Processes Acta Inf. 32 6 1995 509-543 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta32.html#Hennessy95 2003-11-25 The Formal Definition of a Real-Time Language. 309-345 1981 16 Acta Inf. http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta16.html#HennesyK81 2003-11-25 On the Recognition of Permuted Supnick and Incomplete Monge Matrices. 559-569 1996 33 Acta Inf. 6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta33.html#DeinekoRW96 2003-11-25 Global Storage Cells for Attributes in an Attribute Grammar. 397-420 1985 22 Acta Inf. 4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta22.html#Sonnenschein85 2003-11-25 Describing an Algorithm by Hopcroft Acta Inf. 2 1973 97-109 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta2.html#Gries73 2003-11-25 The Schorr-Waite Graph Marking Algorithm. 223-232 1979 11 Acta Inf. http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta11.html#Gries79 2003-11-25 Some Comments on "Concurrent Readers and Writers" Acta Inf. 8 1977 335-340 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta8.html#Conradi77 2003-11-25 Consistent and Complementary Formal Theories of the Semantics of Programming Languages Acta Inf. 3 1974 135-153 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta3.html#HoareL74 2003-11-25 M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. 813-857 1998 35 Acta Inf. 10 http://link.springer.de/link/service/journals/00236/bibs/8035010/80350813.htm http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta35.html#BestFHKP98 2003-11-25 An Axiomatic Definition of the Programming Language PASCAL Acta Inf. 2 1973 335-355 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta2.html#HoareW73 2003-11-25 Incremental LR Parers. 307-321 1978 10 Acta Inf. http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta10.html#Celentano78 2003-11-25 The Undecidability of the Unification and Matching Problem for Canonical Theories. 157-171 1987 24 Acta Inf. 2 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta24.html#HeilbrunnerH87 2003-11-25 Towards a Theory of Consistency Enforcement. 97-141 1999 36 Acta Inf. 2 http://link.springer.de/link/service/journals/00236/bibs/9036002/90360097.htm http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta36.html#ScheweT99 2003-11-25 Algebraic Models of Microprocessors: Architecture and Organisation. 421-456 1996 33 Acta Inf. 5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta33.html#HarmanT96 2004-03-03 A word on 7 letters which is non-repetitive up to mod 5. 451-468 2003 39 Acta Inf. 6-7 http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=451 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#CurrieM03 2004-03-03 On Gurevich's theorem on sequential algorithms. 273-305 2003 39 Acta Inf. 4 http://dx.doi.org/10.1007/s00236-002-0106-3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Reisig03 2004-03-03 Stepwise development of fair distributed systems. 233-271 2003 39 Acta Inf. 4 http://dx.doi.org/10.1007/s00236-002-0103-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Wabenhorst03 2004-03-03 Fundamentals of control flow in workflows. 143-209 2003 39 Acta Inf. 3 http://dx.doi.org/10.1007/s00236-002-0105-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#KiepuszewskiHA03 2004-03-03 A comparison of pebble tree transducers with macro tree transducers. 613-698 2003 39 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-003-0120-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#EngelfrietM03 2004-03-03 Strong bisimilarity of simple process algebras: complexity lower bounds. 469-499 2003 39 Acta Inf. 6-7 http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=469 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Srba03 2004-03-03 Edsger W. Dijkstra - Acta Informatica and Marktoberdorf. 141-142 2003 39 Acta Inf. 3 http://dx.doi.org/10.1007/s00236-003-0109-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#BauerB03 2004-03-03 Ideal preemptive schedules on two processors. 597-612 2003 39 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-003-0119-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#CoffmanST03 2005-11-16 Networks of evolutionary processors. 517-529 2003 39 Acta Inf. 6-7 http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=517 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#CastellanosMMS03 2004-03-03 Structural operational semantics and bounded nondeterminism. 501-516 2003 39 Acta Inf. 6-7 http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=501 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#FokkinkV03 2004-03-03 Preference rankings in the face of uncertainty. 211-231 2003 39 Acta Inf. 3 http://dx.doi.org/10.1007/s00236-003-0108-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Hesselink03 2004-03-03 Towards action refinement for true concurrent real time. 531-577 2003 39 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-003-0117-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Majster-CederbaumW03 2004-03-03 Coincidental extension of scattered context languages. 307-314 2003 39 Acta Inf. 5 http://dx.doi.org/10.1007/s00236-003-0112-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Meduna03 2004-03-03 Adding inclusion dependencies to an object-oriented data model with uniqueness constraints. 391-449 2003 39 Acta Inf. 6-7 http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=391 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#BiskupP03 2004-03-03 Erratum: Coincidental extension of scattered context languages. 699 2003 39 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-003-0127-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Meduna03a 2004-03-03 Reasoning about probabilistic sequential programs in a probabilistic logic. 315-389 2003 39 Acta Inf. 5 http://dx.doi.org/10.1007/s00236-003-0113-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Ying03 2004-03-03 A note on pure and p-pure languages. 579-595 2003 39 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-003-0107-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta39.html#Silva03 2004-03-03 Specification transformers: a predicate transformer approach to composition. 265-301 2004 40 Acta Inf. 4 http://dx.doi.org/10.1007/s00236-003-0130-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#CharpentierC04 2004-03-03 Extending the accommodating function. 3-35 2003 40 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-003-0124-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#BoyarFLN03 2004-03-03 A distributed QoS-Aware multicast routing protocol. 211-233 2003 40 Acta Inf. 3 http://dx.doi.org/10.1007/s00236-003-0123-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#LayuanC03 2004-03-03 Pipelines: Modelling a software architecture through relations. 37-79 2003 40 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-003-0121-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#Doberkat03 2004-03-03 A bi-criterion single-machine scheduling problem with learning considerations. 303-315 2004 40 Acta Inf. 4 http://dx.doi.org/10.1007/s00236-003-0132-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#LeeWS04 2004-03-03 Sticky-free and overhang-free DNA languages. 119-157 2003 40 Acta Inf. 2 http://dx.doi.org/10.1007/s00236-003-0118-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#KariKLW03 2004-03-03 Providing view synchrony for group communication services. 159-210 2003 40 Acta Inf. 3 http://dx.doi.org/10.1007/s00236-003-0129-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#LesleyF03 2004-03-03 Element distinctness on one-tape Turing machines: a complete solution. 81-94 2003 40 Acta Inf. 2 http://dx.doi.org/10.1007/s00236-003-0125-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#Ben-AmramBP03 2004-03-03 Canonical prefixes of Petri net unfoldings. 95-118 2003 40 Acta Inf. 2 http://dx.doi.org/10.1007/s00236-003-0122-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#KhomenkoKV03 2004-03-03 Program reversals for evolutions with non-uniform step costs. 235-263 2004 40 Acta Inf. 4 http://dx.doi.org/10.1007/s00236-003-0131-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#Walther04 2004-06-28 On the equivalence and rewriting of aggregate queries. 529-584 2004 40 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-004-0101-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#GrumbachRT04 2004-06-28 Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. 367-383 2004 40 Acta Inf. 5 http://dx.doi.org/10.1007/s00236-003-0134-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#HeJ04 2004-06-28 Exhaustive generation of combinatorial objects by ECO. 585-602 2004 40 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-004-0139-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#BacchelliBGP04 2004-06-28 Timed automata with urgent transitions. 317-347 2004 40 Acta Inf. 5 http://dx.doi.org/10.1007/s00236-003-0135-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#BarbutiT04 2004-06-28 Trajectory-based codes. 491-527 2004 40 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-004-0140-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#Domaratzki04 2004-06-28 Self-embedded context-free grammars with regular counterparts. 349-365 2004 40 Acta Inf. 5 http://dx.doi.org/10.1007/s00236-003-0133-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#AndreiCC04 2004-06-28 A new natural structural congruence in the pi-calculus with replication. 385-430 2004 40 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-004-0141-3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#EngelfrietG04 2004-06-28 On the complexity of drawing trees nicely: corrigendum. 603-607 2004 40 Acta Inf. 8 http://dx.doi.org/10.1007/s00236-004-0138-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#AkkermanBJT04 2004-06-28 Reducing non-determinism in right nulled GLR parsers. 459-489 2004 40 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-004-0137-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#ScottJ04 2004-06-28 Past is for free: on the complexity of verifying linear temporal properties with past. 431-458 2004 40 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-003-0136-5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#Markey04 2005-01-25 On best transitive approximations to simple graphs. 637-655 2004 40 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-004-0144-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#DelvauxH04 2005-01-25 Self-stabilizing group communication in directed networks. 609-636 2004 40 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-004-0143-1 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#DolevS04 2005-01-25 Approximation schemes for the Min-Max Starting Time Problem. 657-674 2004 40 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-004-0145-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta40.html#EpsteinT04 2005-01-25 Erratum: The size of random bucket trees via urn models. 63 2004 41 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-004-0148-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Mahmoud04a 2005-01-25 An axiomatization of graphs. 19-61 2004 41 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-004-0149-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#BozapalidisK04 2005-01-25 Trading polarizations for labels in P systems with active membranes. 111-144 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-004-0153-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#AlhazovPP04 2005-01-25 Project scheduling with irregular costs: complexity, approximability, and algorithms. 83-97 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-004-0150-2 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#GrigorievW04 2005-01-25 P systems with symport/antiport simulating counter automata. 145-170 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-004-0154-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#FriscoH04 2005-01-25 Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. 99-110 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-004-0152-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#MahmoudT04 2005-01-25 Random sprouts as internet models, and Pólya processes. 1-18 2004 41 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-004-0146-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Mahmoud04 2005-01-25 Maintaining mobile transactional consistency in hybrid broadcast environments. 65-81 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-003-0142-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#KimYL04 2005-01-25 Three-element codes with one d-primitive word. 171-180 2004 41 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-004-0155-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#LiT04 2005-03-14 Type-based hot swapping of running modules. 181-220 2005 41 Acta Inf. 4-5 http://www.springerlink.com/index/10.1007/s00236-004-0151-1 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Duggan05 2005-03-14 Families of automata characterizing context-sensitive languages. 293-314 2005 41 Acta Inf. 4-5 http://www.springerlink.com/index/10.1007/s00236-004-0160-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#MorvanR05 2005-03-14 Hybrid networks of evolutionary processors are computationally complete. 257-272 2005 41 Acta Inf. 4-5 http://www.springerlink.com/index/10.1007/s00236-004-0158-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Csuhaj-VarjuMM05 2005-03-14 Fast allocation and deallocation with an improved buddy system. 273-291 2005 41 Acta Inf. 4-5 http://www.springerlink.com/index/10.1007/s00236-004-0159-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#BrodalDM05 2005-03-14 A deterministic skip list for k-dimensional range search. 221-255 2005 41 Acta Inf. 4-5 http://www.springerlink.com/index/10.1007/s00236-004-0157-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#LamoureuxN05 2005-04-25 On the complexity of deciding typability in the relational algebra. 367-381 2005 41 Acta Inf. 6 http://dx.doi.org/10.1007/s00236-005-0162-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Vansummeren05 2005-04-25 Optimal recovery schemes in fault tolerant distributed computing. 341-365 2005 41 Acta Inf. 6 http://dx.doi.org/10.1007/s00236-005-0161-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#KlonowskaLLS05 2005-04-25 Preemptive online algorithms for scheduling with machine cost. 315-340 2005 41 Acta Inf. 6 http://dx.doi.org/10.1007/s00236-004-0156-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#JiangH05 2005-11-14 The stuttering principle revisited. 415-434 2005 41 Acta Inf. 7-8 http://dx.doi.org/10.1007/s00236-005-0164-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#KuceraS05 2005-11-14 A comprehensive database schema integration method based on the theory of formal concepts. 475-524 2005 41 Acta Inf. 7-8 http://dx.doi.org/10.1007/s00236-005-0166-2 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#SchmittS05 2005-11-14 Compiling quantum programs. 435-474 2005 41 Acta Inf. 7-8 http://dx.doi.org/10.1007/s00236-005-0165-3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Zuliani05 2005-11-14 The weakest specifunction. 383-414 2005 41 Acta Inf. 7-8 http://dx.doi.org/10.1007/s00236-005-0163-5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#ChenS05 2005-11-14 pi-calculus with noisy channels. 525-593 2005 41 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-005-0168-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#Ying05 2005-11-14 Online square and cube packing. 595-606 2005 41 Acta Inf. 9 http://dx.doi.org/10.1007/s00236-005-0169-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta41.html#EpsteinS05 2005-12-14 Enhanced prefetching and caching strategies for single- and multi-disk systems. 21-42 2005 42 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-005-0170-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Buttner05 2005-12-14 Subtyping for session types in the pi calculus. 191-225 2005 42 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-005-0177-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#GayH05 2005-12-14 MOMI: a calculus for mobile mixins. 143-190 2005 42 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-005-0176-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#BettiniVB05 2005-12-14 Exponentially decreasing number of operations in balanced trees. 57-78 2005 42 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-005-0173-3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#JacobsenL05 2005-12-14 safeDpi: a language for controlling mobile code. 227-290 2005 42 Acta Inf. 4-5 http://dx.doi.org/10.1007/s00236-005-0178-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#HennessyRY05 2005-12-14 N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. 43-56 2005 42 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-005-0171-5 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#GeertsSB05 2005-12-14 Type-based information flow analysis for the pi-calculus. 291-347 2005 42 Acta Inf. 4-5 http://dx.doi.org/10.1007/s00236-005-0179-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Kobayashi05 2005-12-14 A general framework for types in graph rewriting. 349-388 2005 42 Acta Inf. 4-5 http://dx.doi.org/10.1007/s00236-005-0180-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Konig05 2005-12-14 Genericity and the pi-calculus. 83-141 2005 42 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-005-0175-1 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#BergerHY05 2005-12-14 Types in concurrency. 79-81 2005 42 Acta Inf. 2-3 http://dx.doi.org/10.1007/s00236-005-0174-2 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#NicolaS05 2005-12-14 <i>K</i>_{s, t}-free graphs. 1-20 2005 42 Acta Inf. 1 http://dx.doi.org/10.1007/s00236-005-0167-1 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Cieslik05 2006-05-10 Non uniform random generation of generalized Motzkin paths. 603-616 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0008-x http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#BrlekPR06 2006-05-10 Vector assignment schemes for asymmetric settings. 501-514 2006 42 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-005-0003-7 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#EpsteinT06 2006-05-10 Splitting forward simulations to copewith liveness. 583-602 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0007-y http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Hesselink06 2006-05-10 Equivalences and optimizations in an expressive XSLT subset. 515-539 2006 42 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-005-0004-6 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#TrombettaM06 2006-05-10 Refinement of actions for real-time concurrent systems with causal ambiguity. 389-418 2006 42 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-005-0172-4 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Majster-CederbaumWY06 2006-05-10 Abstractions of data types. 639-671 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0010-3 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#TipleaE06 2006-05-10 Embedding linear orders in grids. 419-428 2006 42 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-005-0001-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#EhrenfeuchtHR06 2006-05-10 A typed encoding of boxed into safe ambients. 429-500 2006 42 Acta Inf. 6-7 http://dx.doi.org/10.1007/s00236-005-0002-8 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Levi06 2006-05-10 Deep pushdown automata. 541-552 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0005-0 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Meduna06 2006-05-10 Recognizability of graph and pattern languages. 553-581 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0006-z http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#BozapalidisK06 2006-05-10 Safe projections of binary data sets. 617-638 2006 42 Acta Inf. 8-9 http://dx.doi.org/10.1007/s00236-006-0009-9 http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta42.html#Tatti06 2004-02-11 A Resource Logic for Multi-Agent Plan Merging. 93-130 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#WeerdtBTW03 2004-01-14 On Induction-Free Provability. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#KrajicekT92 107-125 2004-01-14 AMAI Special Issue on Temporal Representation and Reasoning. 1-2 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#X00 2004-01-14 Research Issues and Trends in Spatial and Temporal Granularities. 1-4 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#X02 2004-01-14 Appendix: Short Description of Existing Provers. 195-202 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#X95 2004-01-14 The Complexity of Read-Once Resolution. 419-435 2002 36 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#BuningZ02 2004-01-14 The Generative Power of Feature Geometry. 37-46 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Kornai93 2004-01-14 Strong bounds on the approximability of two Pspace-hard problems in propositional planning. 133-147 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#Jonsson99 2004-01-14 An Upper Bound on the Time Complexity of Iterative-Deepening-A. 265-277 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#PatrickAN92 2004-01-14 Mechanical Theorem Proving in the Local Theory of Surfaces. 25-46 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Li95 2004-01-14 Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints. 315-343 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Srivastava93 2004-01-14 Reasoning composite beliefs using a qualitative approach. 1-23 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Sy91 2004-01-14 An Adaptive Reasoning Approach Towards Efficient Ordering of Composite Hypotheses. 303-338 1993 10 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Sy93 2004-01-14 On Inductive Inference of Cyclic Structures. 167-208 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#MaherS95 2004-01-14 Gibbs and Markov Properties of Graphs. 13-26 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Koster97 2004-01-14 From Ants to A(ge)nts: A Special Issue on Ant-Robotics. 1-5 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#WagnerB01 2004-01-14 Foundations of distributed interaction systems. 127-168 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#FayzullinNPS00 2004-01-14 Introducing the Mathematical Category of Artificial Perceptions. 267-298 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#Arzi-GonczarowskiL98 2004-01-14 An Optimal Strategy for the Constrained Cycle Cover Problem. 313-325 2002 34 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#PesantS02 2004-01-14 Sufficient Conditions for Deceptive and Easy Binary Functions. 385-408 1993 10 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#DebG93 2004-01-14 On Rules of Abduction. 387-420 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Zadrozny93 2004-01-14 Persistence and minimality in epistemic logic. 25-47 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#HoekJT99 2004-01-14 Automated Production of Traditional Proofs for Theorems in Euclidean Geometry. 109-138 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#ZhangCG95 2004-01-14 Editorial - Logic Programming with Non-monotonic Semantics: Representing Knowledge and its Computation. 161-164 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#DixL99 2004-01-14 A Continuum of Discrete Systems. 153-186 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#BlairCDFH97 2004-01-14 Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts. 99-138 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#DennisBG00 2004-01-14 Describing Symmetrical Structures in Logic. 301-314 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#StrooperE93 2004-02-03 On the Monotonicity of (LDL) Logic Programs with Set. 107-127 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#Dong93 2004-01-14 A prospective on mathematics and artificial intelligence: Problem solving=Modeling+Theorem proving. 17-20 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Greenberg00 2004-01-14 Neural Networks and Heuristic Search. 75-95 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#Greenberg90 2004-01-14 Consistency, Redundancy, and Implied Equalities in Linear Systems. 37-83 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Greenberg96 2004-01-14 Many-Valued Logic and Mixed Integer Programming. 231-263 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Hahnle94 2004-01-14 Focusing on Independent Diagnosis Problems. 329-349 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#FreitagF94 2004-01-14 Approximate Matching of Polygonal Shapes. 251-265 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#AltBB95 2004-01-14 From Logic Programming Towards Multi-Agent Systems. 391-419 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#KowalskiS99 2004-01-14 Rule-Based Languages. 215-259 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#Vianu97 2004-01-14 Relating Logic Programming Theories of Actions and Partial Order Planning. 131-151 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Baral97 2004-01-14 Temporal Methods: Multi-Dimensional Modeling of Sequential Circuits. 399-413 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#HoltzblattNPV94 2004-01-14 Computations on One Dimensional Cellular Automata. 285-309 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Mazoyer96 2004-01-14 Efficient matching of nonrectangular shapes. 211-224 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#AmirF91 2004-01-14 Top-Down Development of Layered Fault Tolerant Systems and its Problems- a Denotic Perspective. 133-150 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Coenen93 2004-01-14 Controlling the Complexity in Model-Based Diagnosis. 297-314 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#MozeticH94 2004-01-14 An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF. 229-245 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#DavydovDB98 2004-01-14 A Learning Procedure for Mathematics. 407-423 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Ammon93 2004-01-14 Computing change and specificity with equational logic programs. 1995 14 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#HolldoblerT95 2006-05-10 Aspect Graphs and Their use in Object Recognition. 347-375 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#EggertSB95 2004-01-14 The Case of the Lying Postman: Decoys and Deception in Negotiation. 361-386 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#ZlotkinR93 2004-01-14 A statistical approach to knowledge acquisition for expert systems. 149-163 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Gale90 2004-01-14 Dynamic Non-Bayesian Decision Making in Multi-Agent Systems. 91-106 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#MondererT99 2004-01-14 Belief revision in a microworld. 135-155 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#FooR91 2004-01-14 Analysis of parallel algorithms using pipeline architectures in computer vision applications. 177-209 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Fong91 2004-01-14 Deriving Constraints Among Argument Sizes in Logic Programs. 361-392 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Gelder91 2004-01-14 Practical Issues on the Projection of Polyhedral Sets. 1992 6 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#HuynhLL92 295-315 2004-01-14 Formalizing a Logic for Logic Programming. 279-302 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#Schlipf92 2004-01-14 Complexity and Undecidability Results for Logic Programming. 257-288 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Schlipf95 2004-01-14 Efficient and inefficient ant coverage methods. 41-76 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#KoenigSL01 2004-01-14 Classification Using Information. 147-168 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#GasarchPSV98 2004-01-14 STCSP - Structured Temporal Constraint satisfaction Problems. 35-67 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#BalabanR99 2004-01-14 Automated Theorem Proving in Mathematics. 425-447 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Pastre93 2005-11-30 Introduction. 1-3 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Hand90 2004-01-14 Tractable Plan Existence Does Not Imply Tractable Plan Generation. 281-296 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#JonssonB98 2004-01-14 Probabilistic Situation Calculus. 393-431 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#MateusPPSS01 2004-01-14 Lemma and cut strategies for propositional model elimination. 113-132 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#GelderO99a 2004-01-14 On Computing Boolean Functions by a Spiking Neuron. 181-191 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#Schmitt98 2004-01-14 The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae. 51-67 1996 18 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#DelgrandeG96 2004-01-14 Conditional Independence in A Coherent Finite Setting. 287-313 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#Vantaggi01 2004-01-14 On the Linear Structure of Betting Criterion and the Checking of Coherence. 83-106 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#BiazzoG02 2004-01-14 Formal Proofs About Rewriting Using ACL2. 239-262 2002 36 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#Ruiz-ReinaAHM02 2004-01-14 Incorporating statistical information into expert classification systems to reduce classification costs. 93-107 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Cox90 2004-01-14 Selected Papers of Logic in AI - Editorial. 1-2 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#Dix99 2004-01-14 How Expressive is Statified Aggregation? 407-434 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#MumickS95 2004-01-14 Mechanical Theorem Proving in Projective Geometry. 139-172 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Richter-Gebert95 2004-01-14 Categorical Shape Theory as a Formal Language for Pattern Recognition?. 25-54 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Porter93 2004-01-14 An Invitation to Fiberwise Topology: The General Framework for Multicolored Images in Pattern Recognition and Some so its Artificial Intelligence Aspects. 193-204 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Pavel93 2004-01-14 Heuristic Search and Pruning in Polynomial Constraints Satisfaction. 319-334 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#Hong97 2004-01-14 Planning for Temporally Extended Goals. 5-27 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#BacchusK98 2004-01-14 Some Artefacts of Integer-computer Circles. 153-181 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Holin96 2004-01-14 Representing and Reasoning about Concurrent Actions with Abductive Logic Programs. 245-303 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#LiP97 2004-01-14 Pattern recognition by an optical thin-film multilayer model. 193-213 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#LiP99 2004-01-14 An Ordering on Subgoals for Planning. 321-342 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Lin97 2005-04-18 An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#HuTL92 235-251 2004-01-14 Symbolic representation of user-defined time granularities. 53-92 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#BettiniS00 2004-01-14 Automated Reasoning with Function Evaluation for COCOLOG. 301-334 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#WangC97 2004-01-14 Unification in Sort Theories and Its Applications. 261-293 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#Weidenbach96 2004-01-14 A Cost Effective Question-Asking Strategy for Horn Clause Systems. 359-379 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#WangT96 2004-01-14 A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus. 93-118 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#FranceschetM00 2006-02-01 Question-Asking Strategies for Horn Clause Systems. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#WangV90 2004-01-14 Independence and Possibilistic Conditioning. 107-123 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Bouchon-MeunierCM02 2005-01-12 Common Theoretical Formulation of the Pattern Recognition, Identification, and Detection Problems. 175-191 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Pau93 2004-01-14 Logic, Semigroups and Automata on Words. 343-384 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Pin96 2004-01-14 Deontic Logic as Founded on Nonmonotonic Logic. 69-91 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Horty93 2004-01-14 In the Realm of Agents. 25-48 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#BelnapP93 2004-01-14 On Stochastic Conditional Independence: the Problems of Characterization and Description. 323-341 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Studeny02 2004-01-14 Semigraphoids and Structures of Probabilistic Conditional Independence. 71-98 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Studeny97 2004-01-14 A Proof of the Vose-Liepins Conjecture. 409-422 1993 10 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Koehler93 2004-01-14 Information and probabilistic reasoning. 367-381 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Wen90 2004-01-14 On-line Motion Planning: Case of a Planar Rod. 1-20 1991 3 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Yap91 2004-01-14 Finding the likely behaviors of static continuous nonlinear systems. 383-397 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Yeh90 2004-01-14 An Average Analysis of Backtracking on Random Constraint Satisfaction Problems. 21-37 2001 33 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#XuL01 2004-01-14 Representation and Reconstruction of Polygons and Polyhedra Using Hierarchical Extended Gaussian Images. 377-401 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#XuS95 2004-01-14 Pseudo-Additive Measures and Triangular-Norm-Based Conditioning. 63-69 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#BenvenutiM02 2004-01-14 Mixed Global Constraints and Inference in Hybrid CLP-IP Solvers. 271-290 2002 34 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#OttossonTH02 2004-01-14 Ordinals II: Some Applications and a Functorial Approach. 27-57 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Vauzeilles96 2004-01-14 From Conditional Events to Conditional Measures: A New Axiomatic Approach. 373-392 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#ColettiS01 2004-01-14 Stochastic Independence in a Coherent Setting. 151-176 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#ColettiS02 2004-01-14 Coordinated Motion Planning for Two Independent Robots. 107-130 1991 3 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#SharirS91 2004-01-14 On Two Pseudo-Paradoxes in Bayesian Analysis. 171-177 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#Pearl01 2004-01-14 Annotated reasoning. 183-222 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#Hutter00 2004-01-14 Composite Distributive Lattices as Annotation Domains for Mediators. 263-277 2002 36 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#CalmetKT02 2004-01-14 Ordinals I: Basic Notions. 1-26 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#FerbusV96 2004-01-14 Assessing the Value of a Second Opinion: the Role and Structure of Exchangeability. 227-252 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#LadB02 2004-01-14 Detecting Stable Matrices. 29-36 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Lady96 2004-01-14 Hierarchical Model for Analysis and Recognition of Handwritten Characters. 149-174 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#LiSG93 2004-01-14 Fuzzy Mathematical Morphology. 55-84 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#BlochM93 2004-01-14 Choosing reference classes and building provisional models. 277-290 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Neufeld90 2004-01-14 Modelling default and likelihood reasoning as probabilistic reasoning. 25-68 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Buntine91 2004-01-14 Exact Complexity of Problems of Incompletely Specified Automata. 237-249 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Creignou96 2004-01-14 A Formal Framework for Evaluating Heuristic Programs. 193-206 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#CowenFK98 2004-01-14 Multi-robot collaboration for robust exploration. 7-40 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#RekleitisDM01 2006-05-02 Definability, Decidability, Complexity. 311-341 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Cegielski96 2004-01-14 Local Projective and Affine Invariants. 203-226 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Weiss95 2004-01-14 Dualization, Decision Lists and Identification of Monotone Discrete Functions. 69-91 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#Bioch98 2004-01-14 Random Planar Shapes and Their Statistical Recognition. 267-279 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Pflug95 2004-01-14 On the complexity of Entailment in Propositional Multivalued Logics. 29-50 1996 18 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#CadoliS96 2004-01-14 A Unary Representation Result for System T. 385-403 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Colson96 2004-01-14 Modal Logic for Default Reasoning. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#MarekT90 2004-01-14 On-Line Learning with Malicious Noise and the Closure Algorithm. 83-99 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#AuerC98 2004-01-14 A General Framework for Time Granularity and Its Application to Temporal Reasoning. 29-58 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#BettiniWJ98 2004-01-14 The relationship between knowledge, belief and certainty. 301-322 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Halpern91 2004-01-14 Set-theoretic completeness for epistemic and conditional logic. 1-27 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#Halpern99 2004-01-14 Coloration Neighbourhood Search With Forward Checking. 327-340 2002 34 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#Prestwich02 2004-01-14 Special cause management: a knowledge-based approach to statistical process control. 21-37 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#AndersonCHJLSS90 2004-01-14 Introspective and Elaborative Processes in Rational Agents. 1-34 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#Ortiz99 2004-01-14 Nested Expressions in Logic Programs. 369-389 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#LifschitzTT99 2004-01-14 On the implication problem for cardinality constraints and functional dependencies. 253-307 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#Hartmann01 2004-01-14 Local Computation with Valuations from a Commutative Semigroup. 51-69 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#LauritzenJ97 2004-01-14 The Input/Output Complexity of Transitive Closure. 331-360 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#UllmanY91 2004-01-14 Dexter: a guide to selecting the best design for an industrial screening experiment. 179-195 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#HaalandLLC90 2004-01-14 Generalized Resolution for 0-1 Linear Inequalities. 271-286 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Hooker92 2004-01-14 Modeling Genetic Algorithms with Markov Chains. 77-88 1992 5 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#NixV92 2004-01-14 Incomplete Deductive Databases. 259-293 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Imielinski91 2004-01-14 Reasoning About Time in the Situation Calculus. 251-268 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#PintoR95 2004-01-14 Recent Work at the Interface of Logic, Combinatorics and Computer Science. 1-15 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#FrancoDW92 2004-01-14 A formal definition and a sound implementation of analogical reasoning in logic programming. 1995 14 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#CostantiniLS95 2004-01-14 Coverage for robotics - A survey of recent results. 113-126 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#Choset01 2004-01-14 Programming with Non-Determinism in Deductive Databases. 97-125 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#GiannottiGSZ97 2004-01-14 Formalizing the Repair Process - Extended Report. 187-201 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#FriedrichGN94 2004-01-14 ^*-algebras with a Two-Point Dual. 287-293 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Mundici92 2004-01-14 Logic Programming and Software Maintenance. 221-229 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#CookeL97 2004-01-14 Self-Conditional Probabilities and Probabilistic Interpretations of Belief Functions. 269-285 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#CookeS01 2004-01-14 Strong Conditional Independence for Credal Sets. 295-321 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#MoralC02 2004-01-14 Search for the best decision rules with the help of a probabilistic estimate. 249-267 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Brailovsky91 2004-01-14 Hypersequents, logical consequence and intermediate logics for concurrency. 225-248 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Avron91 2004-01-14 An Exercise in an Interactive Geometrical Research. 239-252 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Avron93 2004-01-14 Integration and Conditioning in Numerical Possibility Theory. 87-123 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#Cooman01 2004-01-14 On Coherent Conditional Probabilities and Disintegrations. 71-82 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#BertiR02 2006-01-12 A Preliminary Specification Methodology for Model-based Diagnosis. 11-32 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#LeitchCCC94 2004-01-14 On Kernels, Defaults and Even Graphs. 1-12 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#DimopoulosMP97 2004-01-14 On Skolemization in Constrained Logics. 95-131 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#BurckertHL96 2004-01-14 Parallelism in Logic Programs. 295-330 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Ramakrishnan91 2004-01-14 Complex Probabilistic Modeling with Recursive Relational Bayesian Networks. 179-220 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#Jaeger01 2004-01-14 Circuits in Bounded Arithmetic, Part I. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Mantzivis92 127-156 2004-01-14 Another Perspective on Default Reasoning. 61-82 1995 15 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Lehmann95 2004-01-14 An Object-Oriented Deductive Language. 211-258 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Caseau91 2004-09-16 Reasoning about the Elementary Functions of Complex Analysis. 303-318 2002 36 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#BradfordCDJW02 2004-01-14 Generalization and Specialization Strategies for Learning r.e. Languages. 1-26 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#JainS98 2004-01-14 On the Construction of Hierarchie Models. 283-296 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#OutRB94 2004-01-14 Syntactical Models and Fixed Points for the Basic Logic of Proofs. 291-322 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Strassen94 2004-01-14 Markov Properties and Factorization of Possibility Distributions. 357-377 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Vejnarova02 2004-01-14 The DARPA Advanced Logistics Project. 409-452 2003 37 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#AdaliP03 2004-01-14 Fast Algebraic Methods for Interval Constraint Problems. 383-411 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#LadkinR97 2004-01-14 Well-founded and Stationary Models of Logic Programs. 141-187 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Przymusinski94 2004-01-14 Static Semantics for Normal and Disjunctive Logic Programs. 323-357 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#Przymusinski95 2004-01-14 The Inheritance of Dynamic and Deontic Integrity Constraints. 393-428 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#WieringaWMD91 2004-01-14 Modeling Connectionist Network Structures: Some Geometric and Categorical Aspects. 279-301 2002 36 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#Pfalzgraf02 2004-01-14 A Category of Geometric Spaces: Some Computational Aspects. 173-194 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Pfalzgraf95 2004-01-14 On Geometric and Topological Reasoning in Robotics. 279-318 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#Pfalzgraf97 2004-01-14 Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. 185-200 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#RosenthalSK92 2004-01-14 Spanning-tree based coverage of continuous areas by a mobile robot. 77-98 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#GabrielyR01 2004-01-14 Term Matching on a Mesh-Connected Array of Processors. 177-186 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#DelcherK95 2004-01-14 A Fast Parallel SAT-Solver - Efficient Workload Balancing. 381-400 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#BohmS96 2004-01-14 Characterizing Crossover in Genetic Algorithms. 1992 5 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#LiepinsV92 27-34 2004-01-14 Preferring Daignoses Using a Partial Order On Assumptions. 169-185 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Junker94 2004-01-14 Attribute and Unification Grammar: A Review and Analysis of Formalisms. 73-105 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Correa93 2004-01-14 Using Computational Learning Strategies as a Tool for Combinatorial Optimization. 237-257 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#BirkendorfS98 2004-01-14 A Linear Programming Approach to Reasoning about Probabilities. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#KavvadiasP90 2004-01-14 Tracking Primary Hyperplane Competitors During Genetic Search. 367-388 1992 6 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#WhitleyDC92 2004-01-14 Some interesting research directions in satisfiability. 7-15 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Franco00 2004-01-14 Constraints and Universal Algebra. 51-67 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#JeavonsCP98 2004-01-14 Towards Specifying Norms. 49-68 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Ryan93 2004-01-14 The statistics of state-spaces. 5-20 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Abramson90 2004-01-14 A taxonomy of parallel strategies for deduction. 223-257 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#Bonacina00 2004-01-14 A model and a first analysis of distributed-search contraction-based strategies. 149-199 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#Bonacina99 2004-01-14 On Non-Determinism in Machines and Languages. 169-213 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#GrumbachL97 2004-01-14 A Temporal Logic-Based Approach for the Description of Object Behavior Evolution. 1-40 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#Arapis93 2004-01-14 Interpretations of Open Default Theories in Non-Monotonic Logics. 307-325 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Kaminski93 2004-01-14 Modular Specifications with Supernormal Defaults. 189-213 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Brass94 2004-01-14 Feasibility in Capacitated Networks: The Effect of Individual Arcs and Nodes. 145-153 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#GhannadanW96 2004-01-14 Global Solutions for Nonlinear Systems Using Qualitative Reasoning. 211-228 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#BradleyOR98 2004-01-14 Properties of Sensitivity Analysis of Bayesian Belief Networks. 323-356 2002 36 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#CoupeG02 2004-01-14 Overview of Disjunctive Logic Programming. 1-24 1994 12 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Minker94 2004-01-14 On the Partial Semantics for Disjunctive Deductive Databases. 59-96 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#EiterLS97 2004-01-14 A data model and algebra for probabilistic complex values. 205-252 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#EiterLW01 2004-01-14 TAME: Using PVS strategies for special-purpose theorem proving. 139-181 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#Archer00 2004-01-14 A Procedural Semantics for Stratified Database Updates. 187-220 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#ChenL97 2004-01-14 General Temporal Knowledge for Planning and Data Mining. 1-19 2001 33 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#MorrisK01 2004-01-14 Representing Diagnosis Knowledge. 33-50 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Poole94 2004-01-14 The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations. 253-266 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Minoux92 2004-01-14 Elimination Procedures for Mechanical Theorem Proving in geometry. 1-24 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Wang95 2004-01-14 Inference Guiding in Propositional Knowledge Bases. 345-356 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#Wang98 2006-09-04 Robust Statistical Methods of 2D and 3D Image Description. 125-148 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#IllingworthJKPP93 2006-03-02 Solving Propositional Satisfiability Problems. 1990 1 167-187 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#JeroslowW90 2004-01-14 Introduction. 1-10 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#ConsoleF94 2004-01-14 A Recognition Network Model-Based Approach to Dynamic Image Understanding. 317-345 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#JurieG95 2004-01-14 A Perspective on Symbolic Mathematical Computing and Artificial Intelligence. 261-277 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#CalmetC97 2004-01-14 Minimal Belief and Negation as Failure in Multi-Agent Systems. 5-32 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#Rosati03 2004-01-14 Schema versioning and database conversion techniques for bi-temporal databases. 23-52 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#WeiE00 2004-01-14 A Closer Look at Mutation in Genetic Algorithms. 423-434 1993 10 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Vose93 2004-01-14 On Completeness theorems for Feature Logics. 175-213 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Moshier93 2004-01-14 An Empirical Test of Patterns for Nonmonotonic Inference. 107-130 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#NevesBR02 2004-01-14 Functional Dependencies among Boolean Dependencies. 83-106 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#DemetrovicsRS93 2004-01-14 On the Asymptotic Performance of IDA*. 161-193 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#MahantiGNPK97 2004-01-14 Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. 241-273 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#Niemela99 2004-01-14 Searching Minimax Game Trees under Memory Space Constraint. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#IbarakiK90 2004-01-14 A Survey of Some Combinatorial Results Concerning Functional Dependencies in Database Relations. 63-82 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#DemetrovicsK93 2004-01-14 The Application of Automated Reasoning to Questions in Mathematics and Logic. 321-369 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#WosM92 2004-01-14 Consistency Checking Reduced to Satisfiability of Concepts in Terminological Systems. 133-157 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#Hollunder96 2004-01-14 Inference of monotonicity constraints in Datalog programs. 29-57 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#BrodskyS99 2004-01-14 On the Structural Simplicity of Machines and Languages. 379-405 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#MoscowitzS95 2004-01-14 An Algorithm for Model-Based Diagnosis That Considers Time. 415-437 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Iwanowski94 2004-01-14 Combination Calculi for Uncertainty Reasoning: Representing Uncertainty Using Distributions. 69-109 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#HummelM97 2004-01-14 The Local Minima of the Error Surface of the 2-2-1 XOR Network. 107-136 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#Sprinkhuizen-KuyperB99 2004-01-14 On Some Vagaries of Vagueness and Information. 343-355 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Termini02 2004-01-14 Optimal Implementation of Morphological Operations on Neighborhood-Connected Parallel Computers. 301-316 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#JiangB95 2004-01-14 An integrated prolog architecture for symbolic and numeric executions. 107-133 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#DespainY91 2004-01-14 Using clausal deductive databases for defining semantics in disjunctive deductive databases. 347-378 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#Seipel01 2004-01-14 Redundancy Elimination with a Lexicographic Solved Form. 85-106 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#ImbertH96 2004-01-14 On Resolution with Short Clauses. 243-260 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#BuroB96 2004-01-14 Semantic Granularity in Ontology-Driven Geographic Information Systems. 121-151 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#FonsecaEDC02 2004-01-14 Further Contributions to Characterizing Diagnosis. 137-167 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#McIlraith94 2004-01-14 On Frequent Sets of Boolean Matrices. 193-209 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#SloanTT98 2004-01-14 Some perspectives on mathematical aspects of artificial intelligence: Logic versus approximation. 31-33 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Richter00 2004-01-14 The Logic of Totally and Partially Ordered Plans: A Deductive Database Approach. 27-58 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#BrogiSZ97 2004-01-14 Modeling Moving Objects over Multiple Granularities. 177-194 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#HornsbyE02 2004-01-14 Diagnosing Tim-Varying Misbehavior: An Approach Based on Model Decomposition. 381-398 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#ConsolePDT94 2004-01-14 Heuristics Used by HERBY for Semantic Tree Theorem Proving. 247-266 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#YuAN98 2004-01-14 Computational Dynamics: Modeling and Visualizing Trajectory Flows in Phase Space. 285-300 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Zhao93 2004-01-14 Probabilistic Default Reasoning with Conditional Constraints. 35-88 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#Lukasiewicz02 2004-11-22 Polynomial Time Uniformization and Non-standard Methods. 75-88 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Ressayre96 2004-01-14 Model-Based Diagnosis of Analog Electronic Circuits. 439-492 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Dague94 2004-01-14 Anytime Clausal Reasoning. 297-318 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#Dalal98 2004-01-14 Editor's remarks. 1-2 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Golumbic00 2004-01-14 ALOGTIME and a Conjecture of S. A. Cook. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Clote92 57-106 2004-01-14 Enhancing medial exert systems with knowledge obtained from statistical data. 261-276 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#McLeishC90 2004-01-14 Efficiently Searching a Graph by a Smell-Oriented Vertex Process. 211-223 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#WagnerLB98 2004-01-14 Maximal state independent approximations to minimal real change. 157-204 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#DekhtyarDDS01 2004-01-14 Embedding Complex Decision Procedures Inside an Interactive Theorem Prover. 475-502 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#ArmandoG93 2004-01-14 Uncertainty in Beliefs and Preferences: Conditions for Optimal Alternatives. 3-10 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#AriasM02 2004-01-14 Theory Diagnoses: A Concise Characterization of Faulty Systems. 263-282 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Friedrich94 2004-01-14 The Kinematics of Cutting Solid Objects. 253-305 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Davis93 2004-01-14 On the Topological Structure of Configuration Spaces. 335-354 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#Sellen97 2004-01-14 Separoids: A Mathematical Framework for Conditional Independence and Irrelevance. 335-372 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#Dawid01 2004-01-14 Compute-intensive methods in artificial intelligence. 35-38 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Selman00 2004-01-14 Distributed problem solving in social insects. 199-221 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#HirshG01 2004-01-14 Paraconsistent Declarative Semantics for Extended Logic Programs. 381-417 2002 36 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#Arieli02 2004-01-14 A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation. 89-105 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Stickel91 2004-01-14 A Feature-based Syntax/Semantics Interface. 107-132 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Nerbonne93 2004-01-14 Restricted Prior Inference for Complex Uncertainty Structures. 315-334 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#GoldsteinW01 2004-01-14 A BDD SAT Solver for Satisfiability Testing: An Industrial Case Study. 315-337 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#PuriG96 2004-01-14 Using Automata Theory for Characterizing the Semantics of Terminological Cycles. 175-219 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#Baader96 2004-01-14 Reasoning on Infeasibility in Distributed Collaborative Computing Environment. 155-176 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Bordetsky96 2004-01-14 Similarity Preservation in Default Logic. 137-160 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#Ben-Eliyahu-ZoharyFK99 2004-01-14 Embedding Relaxations in Global Constraints for Solving TSP and TSPTW. 291-311 2002 34 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#FocacciLM02 2004-01-14 Secure Agents. 169-235 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#BonattiKS03 2004-01-14 Computational Mereology: A Study of Part-of Relations for Multimedia Indexing. 83-100 1995 15 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#ZadroznyK95 2004-01-14 Computational Complexity and Constraint Logic Programming Languages. 163-189 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#CoxMT92 2004-01-14 Nonmonotonicity and Compatibility Relations in Belief Structures. 161-176 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#Yager02 2004-01-14 TALplanner: A temporal logic based forward chaining planner. 119-169 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#KvarnstromD00 2004-01-14 Formal Power Series. 59-73 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Delon96 2004-01-14 Dynamic Maintenance of the Transitive Closure in Disjunctive Graphs. 151-176 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#LoboYY95 2004-01-14 Deep Blue's contribution to AI. 27-30 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Newborn00 2004-01-14 A Formal Analysis of the Role of Multi-Point Crossover in Genetic Algorithms. 1992 5 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#JongS92 1-26 2004-01-14 Towards a Formal Theory of Defeasible Deontic Conditionals. 151-166 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Jones93 2004-01-14 Cellular Automata, Matrix Substitutions and Fractals. 345-362 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#HaeselerPS93 2004-01-14 Integrating statistical theory with statistical databases. 245-259 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Lubinsky90 2004-01-14 An Argumentation Framework in Default Logic. 93-132 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Prakken93 2004-01-14 Disjunctive LP + Integrity Constraints = Stable Model Semantics. 449-474 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#FernandezLMS93 2004-01-14 On Semidefinite Programming Relaxations of (2+p)-SAT. 285-305 2003 37 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#KlerkM03 2004-01-14 Boosting Complete Techniques Thanks to Local Search Methods. 319-331 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#MazureSG98 2004-01-14 On Stratified Disjunctive Programs. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#RajasekarM90 2004-01-14 DWAM - A WAM Model Extension for Disjunctive Logic Programming. 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#RajasekarY95 2004-01-14 Propositional Truth Maintenance Systems: Classification and Complexity Analysis. 207-232 1993 10 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Rutenburg93 2004-01-14 A survey of temporal extensions of description logics. 171-210 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#ArtaleF00 2004-01-14 The use of a strategy language for solving search problems. 35-64 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#CastroB00 2004-01-14 Near-Horn Prolog and the Ancestry Family of Procedures. 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#ReedL95 2004-01-14 Fixed Point Theorems in Logic Programming. 231-243 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#KhamsiM97 2004-01-14 Software abstraction of elements of statistical strategy. 291-307 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Oldford90 2004-01-14 An Algebraic Model for Generating and Adapting Neural Networks by Means of Optimization Methods. 93-111 2001 33 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#BarriosMPR01 2004-01-14 Logical and algorithmic properties of independence and their application to Bayesian networks. 165-178 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#GeigerP90 2004-01-14 Maintenance scheduling problems as benchmarks for constraint algorithms. 149-170 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#FrostD99 2004-01-14 A Boundary-Sensitive Approach to Qualitative Location. 93-114 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#BittnerS98 2004-01-14 Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. 273-283 2003 37 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#MaarenW03 2004-01-14 Applying Restriction Constraints to Deductive Databases. 3-25 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#AquilinoART97 2004-01-14 Motion Planning in the Presence of Movable Obstacles. 131-150 1991 3 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Wilfong91 2004-01-14 Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem. 97-109 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#HansenAR90 2004-01-14 Introduction: Logic Programming, Non-Monotonic Reasoning and Reasoning about Actions. 129 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#BaralKL97 2004-01-14 Generalized Disjunctive Well-Founded Semantics for Logic Programs. 89-131 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#BaralLM92 2004-01-14 Davis-Putnam Resolution versus Unrestricted Resolution. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Goerdt92 169-184 2004-01-14 Towards Reasoning about Hoare Relations. 265-289 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#DemriOR94 2004-01-14 Temporal Resolution Using a Breadth-First Search Algorithm. 87-115 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#Dixon98 2004-01-14 D: Set-theoretic query language capturing LOGSPACE. 309-345 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#LeontjevS01 2004-01-14 An occurrence-based model of word categorization. 1995 14 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#BenschS95 2004-01-14 Possibility Theory, Probability Theory and Multiple-Valued Logics: A Clarification. 35-66 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#DuboisP01 2004-01-14 CAPSUL: A constraint-based specification of repeating patterns in time-oriented data. 3-22 2000 30 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai30.html#ChakravartyS00 2004-01-14 Quantum Mereotopology. 153-175 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#SmithB02 2004-01-14 Recursion Theoretic Models of Learning: Some Results and Intuitions. 151-166 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#SmithG95 2006-02-01 On Renamable Horn and Generalized Horn Functions. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#ChandruCHMS90 2004-01-14 A Probabilistic Matching Algorithm for Computer Vision. 85-124 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#CampsSH93 2004-01-14 Contrary-to-duty reasoning with preference-based dyadic obligations. 49-78 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#TorreT99 2004-01-14 A study of homogeneity in relational databases. 379-414 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#Torres01 2004-01-14 A nondeterministic well-founded semantics. 1995 14 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#Torres95 2004-06-02 Probabilistic Argumentation Systems and Abduction. 177-195 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#KohlasBH02 2004-01-14 The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - II. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Rosenthal92 201-234 2004-01-14 On Measuring Uncertainty and Uncertainty-Based Information: Recent Developments. 5-33 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#KlirS01 2004-01-14 Probability Density Decomposition for Conditionally Dependent Random Variables Modeled by Vines. 245-268 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#BedfordC01 2004-01-14 Efficient Distribution-Free Population Learning of Simple Concepts. 53-82 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#NakamuraTA98 2004-01-14 Intelligent Backtracking in CLP(R). 189-211 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#BurgLH96 2004-01-14 Somewhat Finite Approaches to Infinite Sentences. 27-36 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Zeitman93 2004-01-14 Propositional Semantics for Disjunctive Logic Programs. 53-87 1994 12 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Ben-EliyahuD94 2004-01-14 On Computing Minimal Models. 3-27 1996 18 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#Ben-EliyahuD96 2004-01-14 Building a Knowledge Base: An Example. 165-199 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#GelfondG99 2004-01-14 Decomposition of object-oriented database schemas. 119-155 2001 33 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#BiskupP01 2004-01-14 Non-mutual captures in cyclic pursuit. 127-146 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#Richardson01 2004-01-14 Undecidable Statements and Random Graphs. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Dolan92 17-25 2004-01-14 Avoiding Duplicate Proofs with the Foothold Refinement. 117-140 1994 12 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Spencer94 2004-01-14 Deterministic FOIES are Strictly Weaker. 127-146 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#DongS97 2004-01-14 Explanatory Diagnoses and Their Characterization by Circumscription. 75-96 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#BesnardC94 2004-01-14 Parameter Learning in Object-Oriented Bayesian Networks. 221-243 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#LangsethB01 2004-01-14 Extending Constraint Logic Programming for Temporal Reasoning. 139-158 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#LammaMM98 2004-01-14 Statistical consultation - Who's the expert?. 65-75 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#ClaydenC90 2004-01-14 Sensor Placement for Diagnosability. 493-509 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Scarl94 2006-06-19 Preference Logics: Towards a Unified Approach to Nonmonotonicity in Deductive Reasoning. 233-280 1993 10 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#BrownMM93 2004-01-14 Exploiting the Normative Aspect of Preference: A Deontic Logic Without Actions. 167-203 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#BrownMW93 2004-11-10 SDL, A Stochastic Algorithm for Learning Decision Lists with Limited Complexity. 281-302 1993 10 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#GomesG93 2004-01-14 A Heuristic Technique for Multi-Agent Planning. 13-67 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#EphratiR97 2004-01-14 A Qualitative Approach to Syllogistic Reasoning. 131-159 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#KhayataPG02 2004-01-14 DYANA: Best-First Hierachical Diagnosis Based on Differential Equation Models. 315-328 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#ReindersPN94 2004-01-14 Perceive this as that - Analogies, artificial perception, and category theory. 215-252 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#Arzi-Gonczarowski99 2004-01-14 On the intertranslatability of non-monotonic logics. 79-128 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#Janhunen99 2004-01-14 The F-logic Approach for Description Languages. 19-60 1995 15 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Balaban95 2004-01-14 Constraint Programming and Graph Algorithms. 271-284 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#GangnetR93 2004-01-14 On the Equivalence of Upward and Downward Inheritance Reasoners. 239-256 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Thirunarayan95 2004-01-14 An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem. 127-144 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Chinneck96 2004-01-14 Beliefs, Time and Incomplete Information in Multiple Encounter Negotiations Among Autonomous Agents. 111-159 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#Kraus97 2004-01-14 On the Computational Cost of Disjunctive Logic Programming: Propositional Case. 289-323 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#EiterG95 2004-01-14 Nonmonotonic Reasoning with Multiple Belief Sets. 225-248 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#EngelfrietHT98 2004-01-14 The logic of events. 315-389 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#ShaferGS00 2004-01-14 Static and Dynamic Aspects of Goal-Oriented Concurrency Control. 257-287 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#VianuV93 2004-01-14 Adaptation of Declaratively Represented Methods in Proof Planning. 299-320 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#HuangKC98 2004-01-14 Semantics and Expressiveness of Disjunctive Ordered Logic. 311-337 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#BuccafurriLR99 2004-01-14 Deception, Dominance and Implicit Parallelism in Genetic Search. 1992 5 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#Whitley92 49-78 2004-01-14 Logical Considerations on Default Semantics. 195-226 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#RoundsZ97 2004-01-14 Non-Determinism in Logic-Based Languages. 151-186 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#AbiteboulV91 2004-01-14 Proof of the Interval Satisfiability Conjecture. 231-238 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Webber95 2004-01-14 Exploiting focal points among alternative solutions: Two approaches. 187-258 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#KrausRF00 2004-01-14 Geometry and Search in Motion Planning. 215-227 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Latombe93 2004-01-14 Negation as Failure for Disjunctive Logic Programming. 25-52 1994 12 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#DungL94 2004-01-14 Decomposition of Multidimensional Distributions Represented by Perfect Sequences. 215-226 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Jirousek02 2004-01-14 Learning Recursive Languages from Good Examples. 27-52 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#LangeNW98 2004-01-14 Reconstruction of polygonal sets by constrained and unconstrained double probing. 345-361 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#BrucksteinL91 2004-01-14 Conditional Obligation, Deontic Paradoxes, and the Logic of Agency. 1-23 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Bartha93 2004-01-14 On Differential Invariants of Planar Curves and Recognizing Partially Occluded. 227-250 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#BrucksteinN95 2004-01-14 The Possibilistic Handling of Irrelevance in Exception-Tolerant Reasoning. 29-61 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#BenferhatDP02 2004-01-14 A New Algorithm for Shortest Paths Among Obstacles in the Plane. 83-105 1991 3 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Mitchell91 2004-01-14 Potential applications of three-way multidimensional scaling and related techniques to integrate knowledge from multiple experts. 77-92 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#CorterC90 2004-01-14 Characterization of Desirable Properties of General Database Decompositions. 129-195 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#Hegner93 2004-01-14 A new variant of the A-algorithm which closes a node at most once. 157-176 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Kundu91 2004-01-14 Finding the Minimum Weight IIS Cover of an Infeasible System of Linear Inequalities. 107-126 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#ParkerR96 2004-01-14 Consistency-Based and Abductive Diagnoses as Generalized Stable Models. 51-74 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#PreistEB94 2004-01-14 Knowledge Based Supervised Fuzzy-Classification: An Application to Image Processing. 67-86 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#BorgiA01 2004-01-14 Multiple Models of Physical Systems - Modeling Intermittent Faults, Inaccuracy, and Tests in Diagnosis. 203-239 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Struss94 2004-01-14 Model-Based and Qualitative Reasoning: An Introduction. 355-381 1997 19 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#Struss97 2004-01-14 Route Generation and Description Using a Logical and an Analogical Framework. 155-179 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#MoulinK98 2004-01-14 A Reasoning Model Based on the Production of Acceptable Arguments. 197-215 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#AmgoudC02 2004-01-14 Purposive Discovery of Operators. 1992 6 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#SimsB92 317-343 2004-01-14 A Semantics for Speech Acts. 47-71 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Singh93 2004-01-14 A Deontic Approach to Database Integrity. 205-238 1993 9 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#Kwast93 2004-01-14 Advances in the Understanding and Use of Conditional Independence. 1-11 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Shafer97 2004-01-14 Probabilistic heuristic estimates. 209-220 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#HanssonM90 2004-01-14 A set expression based inheritance system. 269-280 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#DaganI91 2004-01-14 Dynamic Temporal Interpretation Contexts for Temporal Abstraction. 159-192 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#Shahar98 2004-01-14 Computing Extended Abduction Through Transaction Programs. 339-367 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#InoueS99 2005-07-04 Diagnosing double regular systems. 171-191 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#BorosU99 2004-01-14 New Approaches for Understanding the Asymptotic Complexity of A Tree Searching. 133-162 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#ChenowethD92 2004-01-14 Consciousness and Complexity: The Cognitive Quest. 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#Perlis95 2004-01-14 Logic Knowledge Bases With Two Default Rules. 333-361 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#RuizM98 2004-01-14 Using Default and Causal Reasoning in Diagnosis. 97-135 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Konolige94 2004-01-14 From Conditional Independences to Factorization Constraints with Discrete Random Variables. 253-285 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Malvestuto02 2004-01-14 The Expressiveness of Locally Stratified Programs. 209-229 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#BlairMS95 2004-01-14 Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. 357-391 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#FrancoS97 2004-01-14 Lengths of Semigraphoid Inferences. 287-294 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#Matus02 2004-01-14 Conditional Independence Structures Examined via Minors. 99-128 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Matus97 2004-01-14 Back and Forth between Continuous and Discrete for the Working Computer Scientist. 89-152 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#ReveillesR96 2004-01-14 Learning-Theoretic Perspectives of Acceptable Numberings. 177-187 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#BaligaS96 2004-01-14 Polynomial-Time Computable Stable Models. 261-290 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#PalopoliZ96 2004-01-14 Efficient Querying and Animation of Periodic Spatio-Temporal Databases. 437-457 2002 36 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#ReveszC02 2004-01-14 Artificial intelligence: Retrospective/prospective. 3-5 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Dershowitz00 2004-01-14 Animal-robots collective intelligence. 223-238 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#SchutterTD01 2004-01-14 Multilayer Neural Networks and Polyhedral Dichotomies. 115-128 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#KenyonP98 2004-01-14 Actors, Actions, and Initiative in Normative System Specification. 289-346 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#WieringaM93 2004-01-14 A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logic Programs. 325-355 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Ferry95 2004-01-14 Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas. 251-272 2003 37 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#BenoistH03 2004-01-14 A Framework for Controlling Model-Based Diagnosis Systems with Multiple Actions. 241-261 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#BottcherD94 2004-01-14 An Empirical Study of the 4-valued Kripke-Kleene and 4-valued Well-Founded Semantics in Random Propositional Logic Programs. 275-309 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#GiannellaS99 2004-01-14 An Se-Tree-Based Prime Implicant Generation Algorithm. 351-366 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Rymon94 2004-01-14 Straightening Euclidean Invariants. 97-108 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Dalbec95 2004-01-14 A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics. 39-67 2001 33 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#GiunchigliaT01 2004-01-14 Program Tactics and Logic Tactics. 235-259 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#GiunchigliaT96 2004-01-14 Structured Proof Procedures. 1-18 1995 15 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#GiunchigliaAP95 2004-01-14 New Proofs in Default Logic Theory. 215-229 1994 12 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#AntoniouLS94 2004-01-14 Modal Nonmonotonic Logics Demodalized. 101-123 1995 15 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Bochman95 2004-01-14 Stable polygons of cyclic pursuit. 147-172 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#Richardson01a 2004-01-14 Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. 101-115 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#IshizakaAS98 2004-01-14 Construction of High-Order Deceptive Functions Using Low-Order Walsh Coefficients. 1992 5 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#Goldberg92 35-47 2004-01-14 Resolution Proofs of Matching Principles. 241-250 2003 37 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#Urquhart03 2004-01-14 The Relative Complexity of Resolution and Cut-Free Gentzen Systems. 1992 6 Ann. Math. Artif. Intell. 1-3 157-168 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Urquhart92 2004-01-14 Possibilistic Merging and Distance-Based Fusion of Propositional Information. 217-252 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#BenferhatDKP02 2004-01-14 Higher order generalization and its application in program verification. 107-126 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#LuMHH00 2004-01-14 Parallel Symbolic Computation in ACE. 359-395 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#PontelliG97 2004-01-14 Propositional lower bounds: Algorithms and complexity. 129-148 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#CadoliPS99 2004-01-14 Statistical guidance in symbolic learning. 135-147 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#FisherC90 2004-01-14 Foundations of Entity - Relationship Modeling. 197-256 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#Thalheim93 2004-01-14 Bayes networks for estimating the number of solutions of constraint networks. 169-186 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#MeiselsSS00 2004-01-14 Most Specific Logic Programs. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#MarriottNL90 2004-01-14 Seminormal Stratified Default Theories. 213-234 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Cholewinski96 2004-01-14 Hybridizing Nonmonotonic Inheritance with Theorem Proving. 1992 6 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#ThomasonA92 345-365 2004-01-14 Cooperation and Competition in ALIAS: A Logic Framework for Agents that Negotiate. 65-91 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#CiampoliniLMTT03 2004-01-14 Focusing Qualitative Simulation Using Temporal Logic: Theoretical Foundations. 59-86 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#BrajnikC98 2004-01-14 A Theory of Nonmonotonic Rule Systems I. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#MarekNR90 2004-01-14 A Theory of Nonmonotonic Rule Systems II. 229-263 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#MarekNR92 2004-01-14 Complexity of Computing with Extended Propositional Logic Programs. 357-378 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#MarekRT95 2004-01-14 Representation Theory for Default Logic. 343-358 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#MarekTT97 2004-01-14 Temporal Granularity and Indeterminacy in Reasoning About Actions and Change: An Approach Based on the Event Calculus. 81-119 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#ChittaroC02 2004-01-14 Temporal representation and reasoning in artificial intelligence: Issues and approaches. 47-106 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#ChittaroM00 2004-01-14 Editorial: Temporal Representation and Reasoning. 1-4 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#ChittaroM98 2004-01-14 Planning Constrained Motion. 21-82 1991 3 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#FortuneW91 2004-02-17 On Line 2-Satisfiability. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#JaumardMMPS90 2004-01-14 Unifying Agent Systems. 131-167 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#Luckd03 2004-01-14 The Algebra of Genetic Algorithms. 339-384 1993 10 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Radcliffe93 2004-01-14 Identifying Nearly Minimal Gödel Numbers from Additional Information. 199-209 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#FreivaldsBW98 2004-01-14 Probabilities of causation: Bounds and identification. 287-313 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#TianP00 2004-01-14 Nonrecursive Incremental Evaluation of Datalog Queries. 187-223 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#DongST95 2004-01-14 Multi-Valued Autoepistemic Logic. 159-174 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#Stark96 2004-01-14 The structure, design principle, and strategies of Mulreg. 117-134 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#DuMouchel90 2004-01-14 Some Formal Properties of Stratified Feature Grammars. 133-173 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#JohnsonM93 2004-01-14 Approximate Qualitative Temporal Reasoning. 39-80 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#Bittner02 2004-01-14 About Classical Logic and Imperative Programming. 405-414 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Krivine96 2004-01-14 Some Results on the Computational Complexity of Symmetric Connectionist Networks. 327-344 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#KasifBDS93 2004-01-14 The Tabu Search Metaheuristic: How we used it. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#HertzW90 2004-01-14 Natural language processing and intelligent interfaces. 39-41 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Stock00 2004-01-14 The Variety Generated by Perfect BL-Algebras: an Algebraic Approach in a Fuzzy Logic Setting. 197-214 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#NolaSEGG02 2004-01-14 Capacity, Complexity, Construction. 1-16 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Manaster-Ramer93 2004-01-14 A toolbox for adding knowledge-based modules to existing statistical software. 109-116 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Darius90 2004-01-14 Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment. 331-379 2003 37 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#HadadKGL03 2004-01-14 Smooth Curve Extraction by Mean Field Annealing. 281-300 1995 13 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#HeraultH95 2004-01-14 A Hypergraph model for Constraint Logic Programming and Applications to Bus Drivers' Scheduling. 247-270 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#CarraresiGR93 2004-01-14 Easy Cases of Probabilistic Satisfiability. 69-91 2001 33 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai33.html#AndersenP01 2004-01-14 Sorting, Linear Time and the Satisfiability Problem. 183-236 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#Grandjean96 2004-01-14 Time in a Causal Theory. 117-138 1998 22 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#KayserM98 2004-01-14 On Multiple Spline Approximations for Bayesian Computations. 267-300 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#Santos97 2004-01-14 Tabling for Non-Monotonic Programming. 201-240 1999 25 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#Swift99 2004-01-14 CROSBY: Financial Data Interpretation as Model-Based Diagnosis. 511-524 1994 11 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai11.html#Hamscher94 2004-01-14 Stochastic Discrimination. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#Kleinberg90 2004-01-14 Errata: ``The relationship between knowledge, belief, and certainty''. 253-256 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#Halpern99a 2004-01-14 Applying the persistent set approach in temporal reasoning. 1995 14 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#ZhangF95 2004-01-14 Proving Ramsey's Theorem by the Cover Set Induction: A Case and Comparison Study. 383-405 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#ZhangH93 2004-01-14 Nonmonotonic Consequences in Default Domain Theory. 227-265 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#ZhangR97 2004-01-14 Complexity Results for HTN Planning. 69-93 1996 18 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#ErolHN96 2004-01-14 Syntax and Semantics for a Fuzzy Temporal Constraint Logic. 357-380 2002 36 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#ViedmaM02 2004-01-14 A propositional theorem prover to solve planning and other problems. 87-112 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#GelderO99 2004-01-14 Techniques for Bayesian analysis in expert systems. 353-364 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#SpiegelhalterL90 2004-01-14 Counterfactual Reasoning by (means of) Defaults. 345-360 1993 9 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai9.html#MeyerH93 2004-01-14 A Modal Contrastive Logic: The Logic of `but'. 291-313 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#MeyerH96 2004-01-14 Constructing Predicate Mappings for Goal-Dependent Abstraction. 169-197 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#OkuboH98 2004-01-14 Automatic Construction of Accurate Models of Physical Systems. 1-28 1996 17 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#BradleyS96 2004-01-14 The Mathematical Modeling of Heuristics. 191-227 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#DavisC92 2004-01-14 Relating Logic Programs Via Program Maps. 229-245 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#KirschenbaumSJ93 2004-01-14 State-Saving Transformations for Efficient Bottom-Up Evaluation of Logic Programs and Rule-Based Systems. 335-356 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#HinkelmannH97 2004-01-14 Nonmonotonic Reasoning: From Complexity to Algorithms. 207-236 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#CayrolLS98 2004-01-14 A Recursion Planning Analysis of Inductive Completion. 363-381 1993 8 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#BarnettBH93 2004-01-14 Formulating Patterns in Problem Solving. 1-23 1993 10 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai10.html#Benjamin93 2004-01-14 Complex Object Multi-Level Fixpoint Queries. 41-62 1993 7 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai7.html#Bussche93 2004-01-14 Parallel cooperative propositional theorem proving. 59-85 1999 26 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai26.html#Okushi99 2004-01-14 Contextual Deontic Logic: Normative Agents, Violations and Independence. 33-63 2003 37 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#Torre03 2004-01-14 An Algebraic Representation of Calendars. 5-38 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#NingWJ02 2004-01-14 A Graphical Characterization of Lattice Conditional Independence Models. 27-50 1997 21 Ann. Math. Artif. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#AnderssonMPT97 2004-01-14 Logic Programming and Reasoning with Incomplete Information. 89-116 1994 12 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai12.html#Gelfond94 2004-01-14 Geometric Foundations for Interval-Based Probabilities. 1-21 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#HaDVH98 2004-01-14 Supporting User-Defined Granularities in a Spatiotemporal Conceptual Model. 195-232 2002 36 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai36.html#KhatriRSO02 2004-01-14 Non-determinism in Deductive Databases - Preface. 1-2 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#PedreschiS97 2004-01-14 Hierarchies of Polynomially Solvable Satisfiability Problems. 339-357 1996 17 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai17.html#Pretolani96 2004-01-14 Probabilistic Reasoning Under Coherence in System P. 5-34 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#Gilio02 2004-01-14 ``Possible is Certain'' is Desirable and Can Be Expressive. 147-168 1997 19 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai19.html#GrecoS97 2004-01-14 Using statistics to make expert systems "user-acquainted". 309-326 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#SauterM90 2004-01-14 Circumscriptive Semantics for Updating Knowledge Bases. 429- 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#Winslett91 2004-01-14 Editorial: Strategies in Automated Deduction. 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#GramlichKP00 2004-01-14 Warm fusion in Stratego: A case study in generation of program transformation systems. 1-34 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#JohannV00 2004-01-14 Branch-and-Cut Solution of Inference Problems in Propositional Logic. 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#HookerF90 2004-01-14 Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with Respect to its Total Learning Time. 117-145 1998 23 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#Zeugmann98 2004-01-14 A Data Dtructure for Arc Insertion and Regular Path Finding. 187-210 1991 3 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai3.html#BuchsbaumKV91 2004-01-14 Why it Might Pay to Assume That Languages are infinite. 17-25 1993 8 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai8.html#Savitch93 2004-01-14 On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons. 129-153 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#Mayoraz98 2005-11-30 Practical experience in developing statistical knowledge enhancement systems. 197-208 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Hand90a 2004-01-14 A Generalized Euclidean Algorithm for Geometry Theorem Proving. 73-96 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#Kalkbrener95 2004-01-14 Ineractive Scheduling as a Constraint Satisfiability Problem. 1990 1 49-73 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#FeldmanG90 2004-01-14 Combining assisted and automated deduction. 21-26 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Kirchner00 2004-01-14 From insect to Internet: Situated control for networked robot teams. 173-197 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#WergerM01 2004-01-14 ECWA Made Easy. 269-274 1995 14 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai14.html#Lifschitz95 2004-01-14 Two Components of an Action Language. 305-320 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#Lifschitz97 2004-01-14 Modeling temporal processes via belief networks and Petri nets, with application to expert systems. 39-64 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Berzuini90 2004-01-14 Remarks on computational learning theory. 43-45 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#Turan00 2004-01-14 Simplification Rules for the Coherent Probability Assessment Problem. 11-28 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#BaiolettiCTV02 2004-01-14 Standard Forms for Rational Linear Arithmetic in Constraint Logic Programming. 303-319 1992 5 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai5.html#HentenryckG92 2004-01-14 Locally Strong Coherence in Inference Processes. 125-149 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#CapotortiV02 2004-01-14 Graded Similarity-Based Semantics for Nonmonotonic Inferences. 89-105 2002 34 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#GodoR02 2004-01-14 Scheduling in the Situation Calculus: A Case Study. 397-421 1997 21 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai21.html#ReiterY97 2004-01-14 The Dimension Method in Elementary and Differential Geometry. 47-72 1995 13 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai13.html#AlbertiFLT95 2004-01-14 Using Tactics to Reformulate Formulae for Resolution Theorem Proving. 221-241 1996 18 Ann. Math. Artif. Intell. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai18.html#KerberP96 2004-01-14 Representation of Preferences by Quasi-Linear Means. 177-195 2002 35 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai35.html#DApuzzoS02 2004-01-14 Relevance sensitive belief structures. 259-285 2000 28 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai28.html#ChopraP00 2004-01-14 Probability propagation. 327-351 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#ShaferS90 2004-01-14 Backtracking and Random Constraint Satisfaction. 393-410 1997 20 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai20.html#Purdom97 2004-01-14 Automating the Synthesis of Decision Procedures in a Constructive Metatheory. 259-279 1998 22 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai22.html#ArmandoGSB98 2004-01-14 Definite Clause Programs are Canonical (over a suitable domain). 1990 1 1-19 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#BlairB90 2004-01-14 Massively Parallel Computations on Many-variable Polynomials. 251-283 1996 16 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai16.html#BeauzamyFM96 2004-01-14 Formulating an approach to develop a system for the temporal analysis of clinical trial data: the POSCH AI project. 237-244 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#IraniSLM90 2004-01-14 A Finite Intersection Property and the Loeb Measurability of Ultrafilters on Hyperfinite Sets. 267-270 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Panetta92 2004-01-14 Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem. 259-269 2002 34 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai34.html#WallaceS02 2004-01-14 ESTES: a statistical expert system for time series analysis. 221-235 1990 2 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai2.html#Hietala90 2004-01-14 On Computability by Logic Programs. 437-456 1995 15 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#Voronkov95 2004-01-14 The representation and manipulation of the algorithmic probability measure for problem solving. 281-300 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Gammerman91 2004-01-14 NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge. 69-90 1999 25 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai25.html#GoldmanGRL99 2004-01-14 ESBL: an integrated method for learning from partial information. 323-343 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Koppel91 2004-01-14 Implicates and reduction techniques for temporal logics. 3-23 1999 27 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai27.html#GuzmanOV99 2004-01-14 Reasoning with Conditional Axioms. 125-149 1995 15 Ann. Math. Artif. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai15.html#KounalisR95 2004-01-14 The Kreisel Length-of-Proof Problem. 1992 6 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai6.html#Farmer92 27-55 2004-01-14 Representing Epistemic Uncertainty by Means of Dialectical Argumentation. 125-169 2001 32 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai32.html#McBurneyP01 2004-01-14 Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs. 99-112 2001 31 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai31.html#YanovskiWB01 2004-01-14 A mathematical formulation of uncertain information. 69-87 1991 4 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai4.html#Tzeng91 2005-09-08 IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment. 381-407 2003 37 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#DixMNZ03 2004-01-14 Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. 21-32 1990 1 Ann. Math. Artif. Intell. http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai1.html#BorosCH90 2004-01-14 Horn Minimization by Iterative Decomposition. 321-343 1998 23 Ann. Math. Artif. Intell. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai23.html#BorosCK98 2004-01-14 Hybridizing Concept Languages. 23-49 1998 24 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai24.html#BlackburnT98 2004-01-14 Proof planning for strategy development. 65-97 2000 29 Ann. Math. Artif. Intell. 1-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai29.html#IrelandS00 2004-01-14 An Overview of Backtrack Search Satisfiability Algorithms. 307-326 2003 37 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#LynceS03 2004-01-14 Automated Deduction Techniques for the Management of Personalized Documents. 211-228 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#BaumgartnerF03 2004-01-14 Sound and Complete Qualitative Simulation Needs "Quantitative" Filtering. 257-267 2003 38 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#Say03 2004-01-14 How to Build a Prototype for a Distributed Digital Mathematics Archive Library. 137-164 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#Michler03 2004-01-14 An Overview of a Formal Framework for Managing Mathematics. 165-191 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#FarmerM03 2004-01-14 Knowledge Representation and Management in ACTIVEMATH. 47-64 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#MelisBGLU03 2004-01-14 On Dynamically Presenting a Topology Course. 91-104 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#CairnsGC03 2004-01-14 Technical Aspects of the Digital Library of Mathematical Functions. 121-136 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#MillerY03 2004-01-14 Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. 233-255 2003 38 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#IbarakiKM03 2004-01-14 Designing Mathematical Libraries Based on Requirements for Theorems. 193-209 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#Schwarzweller03 2004-01-14 Preface. 1-2 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#BuchbergerGH03 2004-01-14 Meta-Stylesheets for the Conversion of Mathematical Documents into Multiple Forms. 3-25 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#NaylorW03 2004-01-14 Mathematical Knowledge Management in HELM. 27-46 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#AspertiPCGS03 2006-03-01 Ontological Engineering and Mathematical Knowledge Management: A Formalization of Projective Geometry. 65-89 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#FurstLT03 2004-01-14 NIST Digital Library of Mathematical Functions. 105-119 2003 38 Ann. Math. Artif. Intell. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#Lozier03 2004-01-14 Duration Consistency Filtering for Qualitative Simulation. 269-309 2003 38 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai38.html#KonikS03 2004-01-14 A Plausibility Description Logic for Handling Information Sources with Heterogeneous Data Representation Formats. 385-430 2003 39 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#PalopoliTU03 2004-01-14 Classes of Spatio-Temporal Objects and their Closure Properties. 431-461 2003 39 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#ChomickiHKR03 2004-01-14 Modelling and Solving Employee Timetabling Problems. 41-59 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#MeiselsS03 2004-01-14 Decision Planning Knowledge Representation Framework: A Case-Study. 147-174 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Pechoucek03 2004-01-14 Brave Nonmonotonic Inference and Its Kinds. 101-121 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Bochman03 2004-01-14 KBFS: K-Best-First Search. 19-39 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#FelnerKK03 2004-01-14 On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices. 211-221 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#BorosGKM03 2004-01-14 Resource-Bounded Paraconsistent Inference. 349-384 2003 39 Ann. Math. Artif. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#MarquisP03 2004-01-14 Declarative Formalization of Reasoning Strategies: A Case Study on Heuristic Nonlinear Planning. 61-100 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Sierra-Santibanez03 2004-01-14 On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries. 291-313 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Jackson03 2004-01-14 Finding Essential Attributes from Binary Data. 223-257 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#BorosHIMY03 2004-01-14 Optimal Sequencing of Contract Algorithms. 1-18 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#ZilbersteinCC03 2004-01-14 How Many Queries Are Needed to Learn One Bit of Information? 333-343 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Simon03 2004-02-05 FlexiMine - A Flexible Platform for KDD Research and Application Development. 175-204 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#Ben-Eliyahu-ZoharyDGLMRS03 2006-07-11 Preface. 1-3 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-006-9023-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#X06 2004-01-14 Extending the Maximum Entropy Approach to Variable Strength Defaults. 123-146 2003 39 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#BourneP03 2004-01-14 Time Series Generation by Recurrent Neural Networks. 315-332 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#PrielK03 2004-01-14 Multiple-Instance Learning of Real-Valued Geometric Patterns. 259-290 2003 39 Ann. Math. Artif. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai39.html#GoldmanS03 2004-01-14 Extremal Theorems for Databases. 165-182 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Tichler04 2004-01-14 Controlled Query Evaluation for Known Policies by Combining Lying and Refusal. 37-62 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#BiskupB04 2004-01-14 Database Repairs and Analytic Tableaux. 5-35 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#BertossiS04 2004-01-14 A Thorough Axiomatization of a Principle of Conditional Preservation in Belief Revision. 127-164 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Kern-Isberner04 2004-01-14 An Order-Based Theory of Updates for Closed Database Views. 63-125 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Hegner04 2004-01-14 Preface. 1-3 2004 40 Ann. Math. Artif. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#EiterS04 2004-02-05 Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination. 373-402 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012873.60775.ba http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#OkushiG04 2004-02-05 Identifying Terminal Distinguishable Languages. 263-282 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012869.49580.35 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Fernau04 2004-02-05 Reasoning with BKBs - Algorithms and Complexity. 403- 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012874.65239.b0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#RosenSS04 2004-02-11 Satisfiability-Based Algorithms for Boolean Optimization. 353-372 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012872.46214.11 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#ManquinhoM04 2004-02-05 Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. 303-352 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012871.08577.0b http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Kullmann04 2004-02-05 Locally Determined Logic Programs and Recursive Stable Models. 225-262 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012868.41613.e7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#CenzerRV04 2004-02-05 Approximation Algorithms for the Class Cover Problem. 215-224 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012867.03976.a5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#CannonC04 2004-02-05 A Theory of Frame Transformations for Belief Combination. 187-214 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012866.73509.10 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#Alvarez04 2004-02-05 Solving Hierarchical Constraints over Finite Domains with Local Search. 283-302 2004 40 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1023/B:AMAI.0000012870.93810.37 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai40.html#HenzYFCWP04 2005-03-15 The Difficulty of Reduced Error Pruning of Leveled Branching Programs. 111-124 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018579.44321.6a http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#ElomaaK04 2005-03-15 On the Semantics of Deliberation in Indigolog - from Theory to Implementation. 259-299 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031197.13122.aa http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#SardinaGLL04 2005-03-15 Programming Rational Agents in a Modal Action Logic. 207-257 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031196.24935.b5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#BaldoniMPG04 2005-03-15 Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming. 135-169 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031194.57352.e7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#VasconcelosRSESW04 2005-03-15 A Unifying Version-Space Representation. 47-76 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018576.88552.df http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#SmirnovHS04 2005-03-15 Go! - A Multi-Paradigm Programming Language for Implementing Multi-Threaded Agents. 171-206 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031195.87297.d9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#ClarkM04 2005-03-15 Introduction. 131-133 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031230.18901.7b http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#DixFLS04 2005-03-15 Theoretical Comparison between the Gini Index and Information Gain Criteria. 77-93 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018580.96245.c6 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#RaileanuS04 2005-03-15 Multi-Agent Systems Specification and Certification: A Situation and State Calculus Approach. 301-338 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031198.84824.45 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#GouveiaR04 2005-03-15 Part and Complement: Fundamental Concepts in Spatial Relations. 1-17 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018575.09226.ff http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#Stell04 2005-03-15 The Complexity of Symmetry-Breaking Formulas. 19-45 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018578.92398.10 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#LuksR04 2005-03-15 Improving Performance of Heterogeneous Agents. 339-395 2004 41 Ann. Math. Artif. Intell. 2-4 http://www.springerlink.com/index/10.1023/B:AMAI.0000031199.58726.9a http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#OzcanSD04 2005-03-15 Improvement of Boosting Algorithm by Modifying the Weighting Rule. 95-109 2004 41 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1023/B:AMAI.0000018577.32783.d2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai41.html#NakamuraNU04 2005-03-15 On Stratified Belief Base Compilation. 399-442 2004 42 Ann. Math. Artif. Intell. 4 http://www.springerlink.com/index/10.1023/B:AMAI.0000038313.15152.5c http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#Coste-MarquisM04 2005-03-15 Multi-Agent Dynamic Logics with Informational Test. 5-36 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034521.22009.8d http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#SchmidtT04 2005-03-15 Erratum for: A Study of Homogeneity in Relational Databases [Annals of Mathematics and Artificial Intelligence 33(2) (2001) 379-414]. 443-444 2004 42 Ann. Math. Artif. Intell. 4 http://www.springerlink.com/index/10.1023/B:AMAI.0000038379.34269.38 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#Torres04 2005-03-15 Speculative Computation Through Consequence-Finding in Multi-Agent Environments. 255-291 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034529.83643.ce http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#InoueI04 2005-03-15 Algebras for Agent Norm-Regulation. 141-166 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034525.49481.4a http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#OdelstadB04 2005-03-15 Logical Preference Representation and Combinatorial Vote. 37-71 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034522.25580.09 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#Lang04 2005-07-25 A New Algebraic Tool for Automatic Theorem Provers. 369-398 2004 42 Ann. Math. Artif. Intell. 4 http://www.springerlink.com/index/10.1023/B:AMAI.0000038312.77514.3c http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#CorderoGMG04 2005-03-15 Agents via Mixed-Mode Computation in Linear Logic. 167-196 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034526.31830.45 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#HarlandW04 2005-03-15 Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols. 227-253 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034528.55456.d9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#YolumS04 2005-03-15 Representing von Neumann-Morgenstern Games in the Situation Calculus. 73-101 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034523.18162.6b http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#SchulteD04 2005-03-15 Extending Answer Sets for Logic Programming Agents. 103-139 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034524.89865.d2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#VosV04 2005-03-15 Proving BDI Properties of Agent-Oriented Programming Languages. 197-226 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034527.45635.e5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#BordiniM04 2005-03-15 A Discrete-Time Quantized-State Hopfield Neural Network. 345-367 2004 42 Ann. Math. Artif. Intell. 4 http://www.springerlink.com/index/10.1023/B:AMAI.0000038311.03614.f0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#Bousono-CalzonS04 2005-03-15 Bounded Nondeterminism of Logic Programs. 313-343 2004 42 Ann. Math. Artif. Intell. 4 http://www.springerlink.com/index/10.1023/B:AMAI.0000038175.53999.3a http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#PedreschiR04 2005-03-15 Computational Logic in Multi-Agent Systems: Recent Advances and Future Directions. 293-305 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034530.72860.31 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#Torroni04 2005-03-15 Introduction. 1-3 2004 42 Ann. Math. Artif. Intell. 1-3 http://www.springerlink.com/index/10.1023/B:AMAI.0000034534.36300.73 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai42.html#DixLS04 2005-03-15 UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. 91-111 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0421-9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#HirschK05 2005-03-15 On deciding subsumption problems. 255-294 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0434-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#EglyPW05 2005-03-15 Testing satisfiability of CNF formulas by computing a stable set of points. 65-89 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0420-x http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Goldberg05 2005-03-15 The SAT2002 competition. 307-342 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0424-6 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#SimonBH05 2005-03-15 Toward leaner binary-clause reasoning in a satisfiability solver. 239-253 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0433-5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Gelder05 2005-03-15 Solving the resolution-free SAT problem by submodel propagation in linear time. 129-136 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0423-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Kusper05 2005-03-15 Extension and equivalence problems for clause minimal formulae. 295-306 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0435-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#BuningZ05 2005-03-15 On exact selection of minimally unsatisfiable subformulae. 35-50 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0418-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Bruni05 2005-03-15 ^<i>n</i>). 173-193 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0428-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#PorschenRS05 2006-01-10 Efficient data structures for backtrack search SAT solvers. 137-152 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0425-5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#LynceM05 2005-03-15 A SAT approach to query optimization in mediator systems. 195-210 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0429-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#PrestwichB05 2005-03-15 Generalizations of matched CNF formulas. 223-238 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0432-6 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Szeider05 2005-03-15 On SAT instance classes and a method for reliable performance experiments with SAT solvers. 1-34 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0417-5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#BrglezLS05 2005-03-15 A parsimony tree for the SAT2002 competition. 343-365 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0431-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#PurdomBS05 2005-03-15 The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. 113-127 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0422-8 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#BuningX05 2005-03-15 The complexity of Boolean constraint satisfaction local search problems. 51-63 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0419-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#ChapdelaineC05 2005-03-15 Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT. 153-172 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0426-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#CoccoM05 2005-03-15 Probability logic and optimization SAT: The PSAT and CPA models. 211-221 2005 43 Ann. Math. Artif. Intell. 1 http://www.springerlink.com/index/10.1007/s10472-005-0430-8 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai43.html#Pretolani05 2005-04-25 Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics. 1-34 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-1808-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Milnikel05 2005-04-25 A new tractable class of constraint satisfaction problems. 61-85 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-1810-9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Dalmau05 2005-04-25 Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. 157-177 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-2369-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#MaarenN05 2005-04-25 Resolution cannot polynomially simulate compressed-BFS. 121-156 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-004-8427-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#MotterRM05 2005-04-25 Semantics for a theory of defeasible reasoning. 87-119 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-1807-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#VoFT05 2005-04-25 A cost-reducing question-selection algorithm for propositional knowledge-based systems. 35-60 2005 44 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-1809-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Wang05 2005-11-14 Introduction. 1-3 2003 37 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1023/A:1020215020635 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai37.html#DixSS03 2006-01-17 Unrestricted vs restricted cut in a tableau method for Boolean circuits. 373-399 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7034-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#JarvisaloJN05 2006-01-17 Iterative Dutch combinatorial auctions. 185-205 2005 44 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-005-4687-8 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#BiswasN05 2006-01-17 Spines of random constraint satisfaction problems: definition and connection with computational complexity. 353-372 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7033-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#IstrateBP05 2006-01-17 The expressive rate of constraints. 341-352 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7031-4 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Chen05 2006-01-17 Used car salesman problem: A differential auction-barter market. 255-267 2005 44 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-005-4691-z http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Ozturan05 2006-01-17 Improving exact algorithms for MAX-2-SAT. 419-436 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7036-z http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#ShenZ05 2006-01-17 Logic programming with infinite sets. 309-339 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7030-5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#CenzerRM05 2006-01-17 Bargaining with incomplete information. 207-232 2005 44 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-005-4688-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#FatimaWJ05 2006-01-17 Auction design with costly preference elicitation. 269-302 2005 44 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-005-4692-y http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Parkes05 2006-01-17 Using multi-agent simulation to understand trading dynamics of a derivatives market. 233-253 2005 44 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-005-4689-6 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#KingSY05 2006-01-17 Learning via finitely many queries. 401-418 2005 44 Ann. Math. Artif. Intell. 4 http://dx.doi.org/10.1007/s10472-005-7035-0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai44.html#Lee05 2006-03-17 Graphoid properties of epistemic irrelevance and independence. 173-195 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9004-z http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#CozmanW05 2006-03-17 Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs. 83-171 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9008-8 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#BamberGN05 2006-03-17 Finding optimal solutions to the graph partitioning problem with heuristic search. 293-322 2005 45 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1007/s10472-005-9001-2 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Felner05 2006-03-17 New tractable classes for default reasoning from conditional knowledge bases. 275-291 2005 45 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1007/s10472-005-9000-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Garcia05 2006-03-17 Epistemic irrelevance on sets of desirable gambles. 197-214 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9011-0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Moral05 2006-03-17 Robust inference of trees. 215-239 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9007-9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#ZaffalonH05 2006-03-17 The complexity of agent design problems: Determinism and history dependence. 343-371 2005 45 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1007/s10472-005-9003-0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#WooldridgeD05 2006-03-17 Relative and absolute order-of-magnitude models unified. 323-341 2005 45 Ann. Math. Artif. Intell. 3-4 http://dx.doi.org/10.1007/s10472-005-9002-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Trave-MassuyesPSA05 2006-03-17 Belief models: An order-theoretic investigation. 5-34 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9006-x http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Cooman05 2006-03-17 Algebraic structure of the families of compatible frames of discernment. 241-274 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9010-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#Cuzzolin05 2006-03-17 Editorial: Imprecise probability perspectives on artificial intelligence. 1-4 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9009-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#ZaffalonC05 2006-03-17 Probabilistic logic under coherence: complexity and algorithms. 35-81 2005 45 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9005-y http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai45.html#BiazzoGLS05 2006-07-11 ⁺. 235-263 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9018-1 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#BolotovB06 2006-07-11 Tableau-based automata construction for dynamic linear time temporal logic*. 289-315 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9020-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#GiordanoM06 2006-07-11 On the security of individual data. 98-113 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9014-x http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#DemetrovicsKM06 2006-07-11 The complexity of embedded axiomatization for a class of closed database views. 38-97 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9013-y http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#Hegner06 2006-07-11 Guest editorial: Temporal representation and reasoning. 231-234 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9024-3 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#BouzidCFL06 2006-07-11 Functional and multivalued dependencies in nested databases generated by record and list constructor. 114-164 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9015-9 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#HartmannLS06 2006-07-11 Sequent forms of Herbrand theorem and their applications. 191-230 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9017-7 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#Lyaletski06 2006-07-11 Regular path queries under approximate semantics. 165-190 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9016-8 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#GrahneT06 2006-07-11 Reasoning on temporal class diagrams: Undecidability results. 265-288 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9019-0 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#Artale06 2006-07-11 Computational methods for database repair by signed formulae. 4-37 2006 46 Ann. Math. Artif. Intell. 1-2 http://dx.doi.org/10.1007/s10472-005-9012-z http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#ArieliDNB06 2006-07-11 An algebraic framework for temporal attribute characteristics. 349-374 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9022-5 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#BohlenGJ06 2006-07-11 A mathematical framework for the semantics of symbolic languages representing periodic time. 317-347 2006 46 Ann. Math. Artif. Intell. 3 http://dx.doi.org/10.1007/s10472-006-9021-6 http://www.informatik.uni-trier.de/~ley/db/journals/amai/amai46.html#EgidiT06 2003-11-28 Inductive Rings and Fields. 133-137 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Shiqiang89 2003-11-28 Arity Hierarchies. 103-163 1996 82 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#Grohe96 2003-11-28 Decidable and undecidable prime theories in infinite-valued logic. 269-278 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#MundiciP01 2006-05-02 Window-accumulated subsequence matching problem is linear. 59-80 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#BoassonCGM01 2003-11-28 Bounded Arithmetic and the Polynomial Hierarchy. 143-153 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#KrajicekPT91 2003-11-28 Periodic Points and Subsystems of Second-Order Arithmetic. 51-64 1993 62 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#FriedmanSY93 2006-05-02 Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France. 1 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#CegielskiPRTW97 2003-11-28 Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. 1 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#ArtemovBEFJV95 2003-11-28 On the Computational Complexity of Integral Equations. 201-228 1992 58 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Ko92 2003-11-28 On the Computability of Fractal Dimensions and Hausdorff Measure. 195-216 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#Ko98 2003-11-28 Loeb Extensions and Ultrapowers of Measures on Fragments. 179-189 1993 60 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Ng93 2003-11-28 Extended use of IST. 73-92 1992 58 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Berg92 2003-11-28 On the Relation between Elementary Partial Difference Equations and Partial Differential Equations. 235-265 1998 92 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Berg98 2003-11-28 A Bounded Arithmetic AID for Frege Systems. 155-199 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#Arai00 2003-11-28 A Slow Growing Analogue to Buchholz' Proof. 101-120 1991 54 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Arai91 2003-11-28 Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection. 93-184 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#Arai98 2003-11-28 Nonisolated degrees and the jump operator. 209-221 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#Wu02 2003-11-28 A Non-Splitting Theorem for d.r.e. Sets. 17-96 1996 82 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#Yi96 2003-11-28 Riesz Representation Theorem, Borel Measures and Subsystems of Second-Order Arithmetic. 65-78 1993 59 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Yu93 2003-11-28 A Study of Singular Points and Supports of Measures in Reverse Mathematics. 211-219 1996 79 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Yu96 2003-11-28 ₂⁰degrees. 195-231 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#Schaeffer02 2003-11-28 Dynamic Notions of Genericity and Array Noncomputability. 37-69 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#Schaeffer98 2004-09-28 Pairs of Recursive Structures. 211-234 1990 46 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#AshK90 2004-09-28 Ramified Systems. 205-221 1994 70 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#AshK94 2004-09-28 Possible Degrees in Recursive Copies. 215-221 1995 75 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#AshK95 2004-09-28 Possible Degrees in Recursive Copies II. 151-165 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#AshK97 2003-11-28 Proof Theory of Reflection. 181-224 1994 68 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Rathjen94 2003-11-28 Abelian C-minimal groups. 1-22 2001 110 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal110.html#Simonetta01 2003-11-28 Weakly Semirecursive Sets and r.e. Orderings. 133-150 1993 60 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#KummerS93 2003-11-28 Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems. 251-277 1996 77 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#MichauxV96 2003-11-28 Borel Equivalence Relations and Classifications of Countable Models. 221-272 1996 82 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#HjorthK96 2003-11-28 Smooth Categories and Global square. 101-138 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#JensenZ00 2003-11-28 Kripke Models and the (In)equational Logic of the Second-Order lambda-Calculus. 257-316 1997 84 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Gallier97a 2003-11-28 A Note on the Diagonalizable Algebras of PA and ZF. 161-173 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Shavrukov93 2003-11-28 Advice Classes of Parameterized Tractability. 119-138 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#CaiCDF97 2005-05-13 General Iteration and Unary Functions. 137-178 1991 54 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#GermanoM91 2003-11-28 Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. 235-276 1995 73 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#AbrahamsonDF95 2003-11-28 On the Idea(l) of Logical Closure. 19-41 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#Kreisel92 2003-11-28 Effective Inseparability in a Topological Setting. 257-275 1996 80 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Spreen96 2003-11-28 Context-Sensitive Transitive Closure Operators. 277-301 1994 66 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Stewart94 2003-11-28 Functional interpretation of Aczel's constructive set theory. 31-73 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Burr00 2003-11-28 Propositional Consistency Proofs. 3-29 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Buss91 2003-11-28 Intuitionistic Validity in T-Normal Kripke Structures. 159-173 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Buss93 2003-11-28 Relating the Bounded Arithmetic and Polynomial Time Hierarchies. 67-77 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Buss95 2003-11-28 Bounded Arithmetic, Proof Complexity and Two Papers of Parikh. 43-55 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Buss99 2003-11-28 First-Order Definability on Finite Structures. 211-225 1989 45 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Ajtai89 2003-11-28 Choice Principles in Hyperuniverses. 35-52 1996 77 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#FortiH96 2003-11-28 Addendum and Corrigendum: Choice Principles in Hyperuniverses. 211-214 1998 92 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#FortiH98 2004-02-19 Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus. 249-299 1997 83 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#Carbone97 2004-02-19 Duplication of Directed Graphs and Exponential Blow Up of Proofs. 1-67 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#Carbone99 2003-11-28 Reverse Mathematics and Ordinal Exponentiation. 1-18 1994 66 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Hirst94 2003-11-28 Boolean products of real closed valuation rings and fields. 119-150 2001 112 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Guier01 2003-11-28 A Simple Propositional S5 Tableau System. 107-115 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Fitting99 2003-11-28 Linear Logic as a Logic of Computations. 183-212 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#Kanovich94a 2003-11-28 Complexity of t-tautologies. 3-11 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#BaazH01 2003-11-28 Complexity of Resolution Proofs and Function Introduction. 181-215 1992 57 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#BaazL92 2003-11-28 Cut Normal Forms and Proof Complexity. 127-177 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#BaazL99 2003-11-28 Generalizing Theorems in Real Closed Fields. 3-23 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#BaazZ95 2003-11-28 Self-Reference and the Acyclicity of Rational Choice. 117-140 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Gaifman99 2003-11-28 Trees, fundamental groups and homology groups. 185-201 2001 111 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#EdaH01 2003-11-28 Arithmetizing Uniform NC. 1-50 1991 53 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Allen91 2003-11-28 Borel Partitions of Infinite Subtrees of a Perfect Tree. 271-281 1993 63 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#LouveauSV93 2003-11-28 Covering a Function on the Plane by Two Continuous Functions on an Uncountable Square - the Consistency. 229-240 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#RabusS00 2003-11-28 Automorphisms of Recursively Saturated Models of Arithmetic. 67-99 1991 55 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#KayeKK91 2003-11-28 Changing cardinal characteristics without changing Omega-sequences or cofinalities. 207-260 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#MildenbergerS00 2003-11-28 The definable multiplicity property and generic automorphisms. 263-273 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#KikyoP00 2003-11-28 Some Applications of Positive Formulas in Descriptive Set Theory and Logic. 95-146 1990 46 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#Dyck90 2003-11-28 Jumping with Random Reals. 197-213 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#BartoszynskiJ90 2003-11-28 Closed Measure Zero Sets. 93-110 1992 58 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#BartoszynskiS92 2003-11-28 Suslin's Hypothesis Does Not Imply Stationary Antichains. 153-167 1993 64 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Schlindwein93 2003-11-28 A Hierarchy of Ramsey Cardinals. 257-277 1990 49 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Feng90 2003-11-28 Church-Rosser property of a simple reduction for full first-order classical natural deduction. 225-237 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#Andou03 2003-11-28 Preface. 1-2 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#ButzKRW00 2003-11-28 A note on the notion of truth in fuzzy logic. 65-69 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#HajekS01 2003-11-28 Degree spectra and computable dimensions in algebraic structures. 71-113 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#HirschfeldtKSS02 2003-11-28 On Winning Ehrenfeucht Games and Monadic NP. 61-92 1996 79 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Schwentick96 2003-11-28 Myhill's Work in Recursion Theory. 43-71 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#DekkerE92 2003-11-28 A Theorem on Barr-Exact Categories, with an Infinitary Generalization. 225-268 1990 47 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Makkai90 2003-11-28 The strength of Mac Lane set theory. 107-234 2001 110 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal110.html#Mathias01 2003-11-28 Linear Independence without Choice. 95-10 1999 101 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#BridgesRS99 2003-11-28 Determinacy and the Sharp Functions on the Reals. 59-85 1991 54 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#DuBose91 2003-11-28 Determinacy and Extended Sharp Functions on the Reals, Part II: Obtaining Sharps from Determinacy. 1-28 1992 58 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#DuBose92 2003-11-28 The core model for almost linear iterations. 205-272 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Schindler02 2003-11-28 Rings of Monoids Elementarily Equivalent to Polynomial Rings. 173-180 1994 68 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Leloup94 2006-07-10 Filter Spaces: Toward a Unified Theory of Large Cardinals and Embedding Axioms. 93-106 1989 41 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#ApterDHZ89 2003-11-28 Positive Definite Functions over Regular f-Rings and Representations as Sums of Squares. 243-257 1989 44 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#MacCaull89 2003-11-28 McNaughton Games and Extracting Strategies for Concurrent Programs. 203-242 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#NerodeRY96 2003-11-28 What's the Difference? 255-261 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#Schmerl98 2003-11-28 Preface. 1-2 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#FinetM01 2003-11-28 A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing Degrees. 167-185 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#LemppL97 2003-12-11 An Extended Lachlan Splitting Theorem. 53-59 1996 79 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#LemppY96 2003-11-28 Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. 169-199 1996 77 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#GradelM96 2003-11-28 Hyperarithmetical Relations in Expansions of Recursive Structures. 163-196 1994 66 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Vlach94 2003-11-28 On Pascal Triangles Modulo a Prime Power. 17-35 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Bes97 2006-06-06 Labelling Systems and r.e. Structures. 99-119 1990 47 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Ash90 2006-06-06 Generalizations of Enumeration Reducibility Using Recursive Infinitary Propositional Sentences. 173-184 1992 58 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Ash92 2003-11-28 Three-Valued Logics: An Introduction, a Comparison of Various Logical Lexica, and Some Philosophical Remarks. 99-145 1989 43 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Hodes89 2003-11-28 Recursive Properties of Relations on Models. 241-269 1993 63 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Hird93 2003-11-28 Finite high-order games and an inductive approach towards Gowers's dichotomy. 39-60 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#Wagner01 2003-11-28 On the Structure of Stable Groups. 85-92 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Wagner97 2003-11-28 Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra. 51-65 1991 55 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#Harizanov91a 2003-11-28 An Undecidability Theorem for Lattices Over Group Rings. 241-262 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Toffalori97 2003-11-28 Boolean Powers of Abelian Groups. 109-115 1990 50 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Eda90 2003-11-28 Analytic Ideals and Cofinal Types. 171-195 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#LouveauV99 2003-11-28 Arity and Alternation in Second-Order Logic. 189-202 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#MakowskyP96 2003-11-28 Erratum to ``Arity and Alternation in Second-Order Logic. 215 1998 92 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#MakowskyP98 2003-11-28 Effective Content of the Calculus of Variations I: Semi-Continuity and the Chattering Lemma. 127-146 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#GeN96 2003-11-28 Uncountable Degree Spectra. 255-263 1991 54 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Harizanov91 2003-11-28 The Possible Turing Degree of the Nonzero Member in a Two Element Degree Spectrum. 1-30 1993 60 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Harizanov93 2003-11-28 Turing Degrees of Certain Isomorphic Images of Computable Relations. 103-113 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#Harizanov98 2003-11-28 Classes bounded by incomplete sets. 273-295 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#HoS02 2003-11-28 Distinguishing Three Strong Saturation Properties in Nonstandard Analysis. 157-171 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Jin99 2003-11-28 Z-modules and ful completeness of multiplicative linear logic. 165-191 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Hamano01 2003-11-28 Joint AILA-KGS Model Theory Meeting, Florence, Italy, 21-24 August 1995 - Preface. 93 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#BoffaMM97 2003-11-28 More on Brouwer's Refutations. 83-91 1989 41 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Scowcroft89 2003-11-28 A New Model for Intuitionistic Analysis. 145-165 1990 47 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Scowcroft90 2003-11-28 Some Purely Topological Models for Intuitionistic Analysis. 173-215 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Scowcroft99 2003-11-28 Mekler's construction preserves CM-triviality. 115-173 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#Baudisch02 2003-11-28 Another Stable Group. 109-138 1996 80 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Baudisch96 2003-11-28 A Model for Intuitionistic Non-Standard Arithmetic. 37-51 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Moerdijk95 2003-11-28 Coercion completion and conservativity in coercive subtyping. 297-322 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Luo01 2003-11-28 <sub>0</sub><sub>i <= n</sub>F(i). 49-56 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#BerarducciD95 2003-11-28 Combinatorial Principles in Elementary Number Theory. 35-50 1991 55 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#BerarducciI91 2003-11-28 Intersection theory for 0-minimal manifolds. 87-119 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#BerarducciO01 2003-11-28 On the Provability Logic of Bounded Arithmetic. 75-93 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#BerarducciV93 2003-11-28 Cancellation Laws for Polynomial-Time p-Isolated Sets. 147-172 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#CrossleyR92 2003-11-28 Completeness Proofs for Propositional Logic with Polynomial-Time Connectives. 39-52 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#CrossleyS89 2003-11-28 <sub>5</sub>-Completeness of Index Sets Arising from the Lattice of Recursively Enumerable Sets. 55-67 1996 80 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Jahn96 2003-11-28 Patterns of Compact Cardinals. 101-115 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Apter97 2003-11-28 Computational complexity of quantifier-free negationless theory of field of rational numbers. 175-180 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Kossovski01 2003-11-28 Strong Stability and the Incompleteness of Stable Models for lambda-Calculus. 247-277 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#BastoneroG99 2003-11-28 Relative efficency of propositional proof systems: resolution vs. cut-free LK. 3-16 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Arai00a 2003-11-28 Solovay's theorem cannot be simplified. 27-41 2001 112 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Arana01 2003-11-28 Multifunction algebras and the provability of PH. 279-302 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Pollett00 2003-11-28 Structure and Definability in General Bounded Arithmetic Theories. 189-245 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#Pollett99 2003-11-28 Best Solving Modal Equations. 183-198 2000 102 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Ghilardi00 2003-11-28 An Algebraic Theory of Normal Forms. 189-245 1995 71 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Ghilardi95 2003-11-28 A Cut-Elimination Proof in Intuitionistic Predicate Logic. 105-136 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#Borisavljevic99 2003-11-28 Game Sentences and Ultrapowers. 261-274 1993 60 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#JinK93 2003-11-28 Essential Kurepa Trees versus Essential Jech-Kunen Trees. 107-131 1994 69 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#JinS94 2003-11-28 Can a Small Forcing Create Kurepa Trees. 47-68 1997 85 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#JinS97 2003-11-28 Cut Elimination for the Unified Logic. 1-16 1993 62 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Vauzeilles93 2003-11-28 A Transfer Theorem in Constructive p-adic Algebra. 29-55 1992 58 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Haskell92 2003-11-28 Scattered Toposes. 97-107 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#EsakiaJP00 2003-11-28 Diophantine Induction. 1-40 1990 46 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#Kaye90 2003-11-28 Hilbert's Tenth Problem for Weak Theories of Arithmetic. 63-73 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Kaye93 2003-11-28 Infinitary Definitions of Equivalence Relations in Models of PA. 37-43 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Kaye97 2003-11-28 Semi-Cohen Boolean Algebras. 187-208 1997 87 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#BalcarJZ97a 2003-11-28 View-Based Explicit Knowledge. 343-368 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Ramanujam99 2003-11-28 A Construction of Boolean Algebras from First-Order Structures. 239-256 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Koppelberg93 2003-11-28 Decidability Problems in Languages with Henkin Quantifiers. 149-172 1992 58 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#KrynickiM92 2003-11-28 Henkin and Function Quantifiers. 273-292 1989 43 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#KrynickiV89 2003-11-28 Inner Model Operators in L(R). 147-184 2000 101 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#Rudominer00 2004-09-28 Permitting, Forcing, and Copying of a Given Recursive Relation. 219-236 1997 86 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#AshCK97 2003-11-28 Natural Deduction for Intuitionistic Linear Logic. 79-108 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Troelstra95 2004-09-28 Quasi-Simple Relations in Copies of a Given Recursive Structure. 203-218 1997 86 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#AshKR97 2003-11-28 Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. 39-64 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#JockuschS91 2003-11-28 Simple Theories. 149-164 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#KimP97 2003-11-28 A More Direct Proof of a Result of Shelah. 261-267 1991 53 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Just91 2003-11-28 Systems of Combinatory Logic Related to Quine's `New Foundations'. 103-133 1991 53 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Holmes91 2003-11-28 Systems of Combinatory Logic Related to Predicative and `Mildly Impredicative' Fragments of Quine's `New Foundations'. 45-53 1993 59 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Holmes93 2003-11-28 Polynomial-Time versus Recursive Models. 17-58 1991 54 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#CenzerR91 2003-11-28 Polynomial-Time Abelian Groups. 313-363 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#CenzerR92 2003-11-28 Feasible Graphs with Standard Universe. 21-35 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#CenzerR98 2003-11-28 Generalizing Classical and Effective Model Theory in Theories of Operations and Classes. 249-308 1991 52 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Mancosu91 2003-11-28 The Intuitionistic Alternative Set Theory. 141-156 1993 59 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Lano93 2003-11-28 Stable Theories, Pseudoplanes and the Number of Countable Models. 147-160 1989 43 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Pillay89 2003-11-28 On the Elimination of Imaginaries from Certain Valued Fields. 241-276 1993 61 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#ScowcroftM93 2003-11-28 Analyzing realizability by Troelstra's methods. 203-225 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Moschovakis02 2003-11-28 A Classical View of the Intuitionistic Continuum. 9-24 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#Moschovakis96 2003-11-28 Definable Sets in Generic Complex Tori. 75-80 1996 77 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Pillay96 2003-11-28 Differential Galois Theory II. 181-191 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Pillay97 2003-11-28 Uniqueness of the implication for totally ordered MV-algebras. 261-268 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#MartinezP01 2003-11-28 Model Theory of Finite Fields and Pseudo-Finite Fields. 95-108 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Chatzidakis97 2003-11-28 A Decision Algorithm for Linear Sentences on a PFM. 273-286 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#LiLL93 2003-11-28 Quantifier Elimination for Modules with Scalar Variables. 161-179 1992 57 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#DriesH92 2003-11-28 Proof-Theoretic Investigations on Kruskal's Theorem. 49-88 1993 60 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#RathjenW93 2003-11-28 Preface: A Selection of Papers Presented at the 9th International Conference of Logic, Methodology and Philosophy of Science. 1 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#PrawitzW93 2003-11-28 A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable Degrees. 275-297 2000 101 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#Lerman00 2003-11-28 A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees. 143-180 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Lerman98 2003-11-28 The Structure of the Honest Polynomial m-Degrees. 113-139 1994 70 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#DowneyGM94 2003-11-28 Constructive Modal Logics I. 271-301 1990 50 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Wijesekera90 2003-11-28 <sup>0</sup><sub>n</sub>-Sets. 145-149 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#Herrmann97 2003-11-28 Computably Enumerable Sets and Quasi-Reducibility. 1-35 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#DowneyLN98 2003-11-28 Friedberg Splittings of Recursively Enumerable Sets. 175-199 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#DowneyS93a 2003-11-28 Stability among r.e. Quotient Algebras. 55-63 1993 59 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Love93 2003-11-28 Partial Orderings with the Weak Freese-Nation Property. 35-54 1996 80 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#FuchinoKS96 2003-11-28 <sub>infty k</sub>-free Boolean Algebras. 265-284 1992 55 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#FuchinoKT92 2003-11-28 Sticks and Clubs. 57-77 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#FuchinoSS97 2006-03-31 Determinacy in the Difference Hierarchy of Co-Analytic Sets. 69-108 1996 80 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Welch96 2003-11-28 Typability and Type Checking in System F are Equivalent and Undecidable. 111-156 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Wells99 2003-11-28 How Complicated is the Set of Stable Models of a Recursive Logic Program? 119-135 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#MarekR92 2003-11-28 Wellfounded trees in categories. 189-218 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#MoerdijkP00 2003-11-28 Type theories, toposes and constructive set theory: predicative aspects of AST. 155-201 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#MoerdijkP02 2003-11-28 Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics. 201-225 1993 63 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#BiroS93 2003-11-28 <sup>2</sup><sub>2</sub><sup>MM</sup>). 1-32 1993 59 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#AbrahamS93 2003-11-28 Hierarchies of Measure-Theoretic Ultrafilters. 203-219 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#Benedikt99 2003-11-28 Linearization of Definable Order Relations. 69-100 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Kanovei00 2003-11-28 Power Set Recursion. 247-306 1995 71 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Moss95 2003-11-28 Coalgebraic Logic. 277-317 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Moss99 2003-11-28 Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis. 51-81 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#Carlson00 2003-11-28 Elementary patterns of resemblance. 19-77 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Carlson01 2003-11-28 Comparing Cubes of Typed and Type Assignment Systems. 267-303 1997 86 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#BakelLRU97 2003-11-28 An Omitting Types Theorem for positive bounded formulas in normed spaces. 279-294 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Ortiz01 2003-11-28 The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets. 37-44 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Cholak98 2003-11-28 On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA. 125-148 1993 65 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#KossakKS93 2003-11-28 A (nother) characterization of intuitionistic propositional logic. 161-173 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Iemhoff01 2003-11-28 Interpreting N in the computably enumerable weak truth talble degrees. 35-48 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Nies01 2003-11-28 <sup>1</sup><sub>1</sub>. 151-205 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#Neeman00 2003-11-28 Inner models in the region of a Woodin limit of Woodin cardinals. 67-155 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Neeman02 2003-11-28 Computation Paths Logic: An Expressive, yet Elementary, Process Logic. 167-186 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#HarelS99 2003-11-28 Total Sets and Objects in Domain Theory. 91-117 1993 60 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Berger93 2006-02-09 Minimal Degrees Recursive in 1-Generic Degrees. 215-225 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#ChongD90 2006-02-09 <sub>n</sub>Cut. 227-235 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#ChongM90 2003-11-28 An Extension of Borel Determinacy. 279-293 1990 49 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Martin90 2003-11-28 2-Sequent Calculus: A Proof Theory of Modalities. 229-246 1992 58 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Masini92 2003-11-28 The Joint Embedding Property in Normal Open Induction. 275-290 1993 60 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Otero93 2003-11-28 On Bimodal Logics of Provability. 115-159 1994 68 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Beklemishev94 2003-11-28 Iterated Local Reflection Versus Iterated Consistency. 25-48 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Beklemishev95 2003-11-28 Induction Rules, Reflection Principles, and Provably Recursive Functions. 193-242 1997 85 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#Beklemishev97 2003-11-28 A Strong Normalization Result for Classical Logic. 99-116 1995 76 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#BarbaneraB95 2003-11-28 Semantics of Weakening and Contraction. 73-106 1994 69 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Jacobs94 2003-11-28 Needed reals and recursion in generic reals. 77-88 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Blass01 2003-11-28 A Game Semantics for Linear Logic. 183-220 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#Blass92 2003-11-28 An Alternative Linear Semantics for Allowed Logic Programs. 3-16 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Jeavons97 2003-11-28 Domain Interpretations of Martin-Löf's Partial Type Theory. 135-196 1990 48 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#PalmgrenS90 2003-11-28 Saturation and Stability in the Theory of Computation over the Reals. 1-49 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#ChapuisK99 2003-11-28 Towards logical operations research - propositional case. 95-119 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#DavydovD01 2003-11-28 Tautologies and Positive Solvability of Linear Homogeneous Systems. 27-43 1992 57 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#DavydovD92 2004-11-23 Triviality, NDOP and Stable Varieties. 119-146 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#HartPS93 2003-11-28 Uniform Proofs as a Foundation for Logic Programming. 125-157 1991 51 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#MillerNPS91 2003-11-28 Morasses, Square and Forcing Axioms. 139-163 1996 80 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Morgan96 2003-11-28 <sup>i</sup><sub>k</sub>. 231-273 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Bloch97 2003-11-28 Axiomatizing the monodic fragment of first-order temporal logic. 133-145 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#WolterZ02 2003-11-28 Borel Equivalence Relations Induced by Actions of the Symmetric Group. 63-112 1998 92 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#HjorthKL98 2003-11-28 Canonization for Two Variables and Puzzles on the Square. 243-282 1997 85 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#Otto97 2003-11-28 The Structure of Lattices of Subframe Logics. 47-100 1997 86 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#Wolter97 2003-11-28 Finite Type Structures within Combinatory Algebras. 101-123 1991 55 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#Bethke91 2003-11-28 Fixed Points in Peano Arithmetic with Ordinals. 119-132 1993 60 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Jager93 2003-11-28 <sub>5</sub>-Completeness of Index Sets Arising from the Recursively Enumerable Turing Degrees. 109-137 1996 79 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Jahn96a 2003-11-28 Descent and Duality. 131-188 1995 71 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Zawadowski95 2003-11-28 Characterizing Language Identification in Terms of Computable Numberings. 51-72 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#JainS97 2003-11-28 Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic. 33-81 1989 41 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Pitts89 2003-11-28 A Global Version of a Theorem of Ben-David and Magidor. 199-222 2000 102 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#ApterC00 2003-11-28 <sub>omega + 1</sub>. 203-219 1995 74 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#ApterM95 2003-11-28 Data Storage Interpretation of Labeled Modal Logic. 57-71 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#ArtemovK96 2003-11-28 Infinite Games Played on Finite Graphs. 149-184 1993 65 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#McNaughton93 2003-11-28 Index Sets Related to Prompt Simplicity. 243-254 1989 42 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Schwarz89 2003-11-28 Ehrenfeucht Games and Ordinal Addition. 53-73 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Maurin97 2003-11-28 Lattices of Modal Logics and Their Groups of Automorphisms. 99-139 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#Kracht99 2003-11-28 Characterizations of Realizable Space Complexities. 171-190 1995 73 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#SeiferasM95 2003-11-28 A Decidable Ehrenfeucht Theory with Exactly Two Hyperarithmetic Models. 135-168 1991 53 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Reed91 2003-11-28 Provability logics with quantifiers on proofs. 373-387 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Yavorsky01 2003-11-28 The Density of Infima in the Recursively Enumerable Degrees. 155-179 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Slaman91 2003-11-28 The Axioms of Constructive Geometry. 169-200 1995 76 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#Plato95 2003-11-28 <sub>0</sub>of explicit mathematics: the limit and Mahlo axioms. 79-101 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#JagerS02 2003-11-28 Totality in Applicative Theories. 105-120 1995 74 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#JagerS95 2003-11-28 Bar Induction and omega Model Reflection. 221-230 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#JagerS99 2003-11-28 When Is Arithmetic Possible? 29-51 1990 50 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#McColm90a 2003-11-28 Non-Commutative Logic I: The Multiplicative Fragment. 29-64 1999 101 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#AbrusciR99 2003-11-28 Count(q) Does Not Imply Count(p). 1-56 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Riis97 2003-11-28 Counterexamples to a Conjecture on Relative Categoricity. 201-209 1990 46 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#EvansH90 2003-11-28 On the Automorphism Groups of Finite Covers. 83-112 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#EvansH93 2003-11-28 On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations. 27-45 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#KamareddineBN99 2003-11-28 Independent Axiomatizability of Sets of Sentences. 259-299 1989 44 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Wojtylak89 2003-11-28 The Indestructability of the Order of the Indescribable Cardinals. 45-91 1992 57 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#Hauser92 2003-11-28 The Consistency Strength of Projective Absoluteness. 245-295 1995 74 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#Hauser95 2003-11-28 Incomparable Prime Ideals of Recursively Enumerable Degrees. 39-56 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Calhoun93 2003-11-28 Degree spectra of relations on structures of finite computable dimension. 233-277 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#Hirschfeldt02 2003-11-28 Realizing Brouwer's Sequences. 25-74 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#Vesley96 2003-11-28 <sub>0</sub>-Categorical Weakly o-Minimal Structures. 65-93 1999 101 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#HerwigMMNT99 2003-11-28 Possible Behaviours for the Mitchell Ordering. 107-123 1993 65 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#Cummings93 2003-11-28 Coherent Sequences versus Radin Sequences. 223-241 1994 70 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#Cummings94 2003-11-28 Non-Bounding Constructions. 191-205 1990 50 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Shoenfield90 2003-11-28 Priority Constructions. 115-123 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#Shoenfield96 2003-11-28 On p-Reducibility of Numerations. 57-60 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Degtev93 2003-11-28 Nonstandard Arithmetic of Hilbert Subsets. 195-202 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Yasumoto91 2003-11-28 Dual realizability in symmetric logic. 389-397 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Zaslavsky01 2006-02-07 1-Generic splittings of computably enumerable degrees. 211-219 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#Wu06 2003-11-28 Strong Polynomial-Time Reducibility. 97-117 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Shinoda97 2003-11-28 Topological Models of Epistemic Set Theory. 147-167 1990 46 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#Goodman90 2003-11-28 A model-theoretic characterization of the weak pigeonhold principle. 175-195 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Thapen02 2003-11-28 Linear Läuchli Semantics. 101-142 1996 77 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#BluteS96 2003-11-28 Trees and Ehrenfeucht-Fraïssé Games. 69-97 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#TodorcevicV99 2003-11-28 Fixed Point Theory in Weak Second-Order Arithmetic. 167-188 1990 47 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#ShiojiT90 2003-11-28 Split BN-pairs of finite Morley rank. 239-264 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#Tent03 2003-11-28 Classifying Totally Categorical Groups (and Others). 81-100 1996 77 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Tent96 2003-11-28 Orbits of computably enumerable sets: low sets can avoid an upper cone. 61-85 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Miller02 2003-11-28 Infinite Combinatorics and Definability. 179-203 1989 41 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Miller89 2003-11-28 Projective Subsets of Separable Metric Spaces. 53-69 1990 50 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Miller90 2003-11-28 Expansions of the Real Field with Power Functions. 79-94 1994 68 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Miller94 2003-11-28 The Lottery Preparation. 103-146 2000 101 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#Hamkins00 2003-11-28 Destruction or Preservation as You Like It. 191-229 1998 91 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#Hamkins98 2003-11-28 Domain Theory in Logical Form. 1-77 1991 51 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Abramsky91 2003-11-28 Forcing in Nonstandard Analysis. 263-297 1994 68 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Ozawa94 2003-11-28 Filters and Large Cardinals. 177-212 1995 72 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#Levinski95 2003-11-28 Constructive Canonicity in Non-Classical Logics. 1-32 1997 86 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#GhilardiM97 2003-11-28 Model Completions, r-Heyting Categories. 27-46 1997 88 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#GhilardiZ97 2003-11-28 Topological Reasoning and the Logic of Knowledge. 73-110 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#DabrowskiMP96 2003-11-28 Algorithms for Sentences over Integral Domains. 189-197 1990 47 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Tung90 2003-11-28 Applications of Fodor's Lemma to Vaught's Conjecture. 1-19 1989 42 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Howard89 2003-11-28 Tabular Degrees in alpha-Recursion Theory. 205-236 1992 55 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#BaileyD92 2003-11-28 To Preference via Entrenchment. 141-155 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Georgatos99 2003-11-28 Deterministic Automata: Simulation, Universality and Minimality. 263-276 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#CaludeCK97 2003-11-28 Groups with Identities. 171-188 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Point89 2003-11-28 Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. 153-193 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#KhoussainovS98 2003-11-28 Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". 297-298 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#KhoussainovS99 2003-11-28 A Common Axiom Set for Classical and Intuitionistic Plane Geometry. 229-255 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#LombardV98 2003-11-28 Relecture constructive de la théorie d'Artin-Schreier. 59-92 1998 91 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#Lombardi98 2003-11-28 Weak Comparability of Well Orderings and Reverse Mathematics. 11-29 1990 47 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#FriedmanH90 2003-11-28 Reverse Mathematics and Homeomorphic Embeddings. 229-253 1991 54 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#FriedmanH91 2003-11-28 Elementary Descent Recursion and Proof Theory. 1-45 1995 71 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#FriedmanS95 2003-11-28 <sub>1</sub>-Definability. 93-99 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#FriedmanV97 2003-11-28 Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. 111-125 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#EiterGG96 2003-11-28 On Restricted Forms of Enumeration Reducibility. 75-96 1990 49 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Watson90 2003-11-28 Decidable Boolean Algebras of Low Level. 75-95 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Goncharov98 2003-11-28 The Bounded Injury Priority Method and the Learnability of Unions of Rectangles. 143-168 1996 77 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#ChenH96 2003-11-28 Undecidability and 1-types in intervals of the computably enumerable degrees. 1-47 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#Ambos-SpiesHS00 2003-11-28 The Continuity of Cupping to 0'. 195-209 1993 64 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Ambos-SpiesLS93 2003-11-28 Terminal notions in set theory. 89-116 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Zapletal01 2003-11-28 More on the Cut and Choose Game. 291-301 1995 76 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#Zapletal95 2003-11-28 Proof-Theoretic Analysis of Termination Proofs. 57-65 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Buchholz95 2003-11-28 Generalized Quantifiers and Pebble Games on Finite Structures. 23-75 1995 74 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#KolaitisV95 2003-11-28 A Semantical Storage Operator Theorem for All Types. 17-31 1998 91 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#Raffalli98 2006-02-09 <sub>2</sub>Systems. 25-38 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Chong89 2003-11-28 Three clouds may cover the plane. 71-75 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Komjath01 2003-11-28 Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I. 243-263 1993 65 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#FefermanJ93 2003-11-28 Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part II. 37-52 1996 79 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#FefermanJ96 2003-11-28 The unfolding of non-finitist arithmetic. 75-96 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#FefermanS00 2003-11-28 Chu Spaces from the Representational Viewpoint. 319-333 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Pratt99 2003-11-28 Chang's Model and Covering Properties. 45-79 1989 42 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Sureson89 2003-11-28 About Prikry Generic Extensions. 247-278 1991 51 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Sureson91 2003-11-28 Symmetric Submodels of a Cohen Generic Extension. 247-261 1992 58 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Sureson92 2003-11-28 Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science ``Logic at St. Petersburg''. 1 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#MatiyasevichN96 2003-11-28 Remarks on Elementary Duality. 183-205 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Prest93 2003-11-28 Interpreting Modules in Modules. 193-215 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Prest97 2003-11-28 Strong Normalization in Type Systems: A Model Theoretic Approach. 53-78 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Terlouw95 2006-06-21 The Manin-Mumford conjecture and the model theory of difference fields. 43-115 2001 112 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Hrushovski01 2003-11-28 Almost Orthogonal Regular Types. 139-155 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Hrushovski89 2003-11-28 Undimensional Theories are Superstable. 117-138 1990 50 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Hrushovski90 2003-11-28 A New Strongly Minimal Set. 147-166 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Hrushovski93 2003-11-28 Projective Forcing. 237-266 1997 86 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#BagariaB97 2003-11-28 Generic absoluteness. 3-13 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#BagariaF01 2003-11-28 Thue trees. 19-59 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#MarcinkowskiP03 2003-11-28 ₂⁰Sets. 317-342 1996 82 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#CooperSY96 2003-11-28 The Undecidability of k-Provability. 75-102 1991 53 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Buss91a 2003-11-28 Unprovability of Consistency Statements in Fragments of Bounded Arithmetic. 221-244 1995 74 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#BussI95 2003-11-28 The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. 93-104 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#BussM99 2003-11-28 On the computational content of intuitionistic propositional proofs. 49-63 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#BussP01 2003-11-28 A Tribute to Dirk van Dalen - Preface. 1 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Gurevich95 2003-11-28 A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. 1-79 1990 48 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#ComptonH90 2003-11-28 Classifying Toposes for First-Order Theories. 33-58 1998 91 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#ButzJ98 2003-11-28 A Geometric Consequence of Residual Smallness. 137-169 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#KearnesKV99 2003-11-28 Preface: A selection of papers presented at the Logic Colloquium '89. 19 1993 62 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Thiele93 2003-11-28 Sufficiency Conditions for Theories with Recursive Models. 305-320 1992 55 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#Hurlburt92 2003-11-28 ₂. 23-87 2001 110 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal110.html#Stanley01 2003-11-28 ¹₂^#. 27-88 1994 66 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Stanley94 2003-11-28 ^#. 157-192 1997 85 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#Stanley97 2003-11-28 On the Proof Theory of Coquand's Calculus of Constructions. 23-101 1997 83 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#Seldin97 2003-11-28 Monotone Inductive Definitions in a Constructive Theory of Functions and Classes. 255-297 1989 42 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Takahashi89 2003-11-28 Equational Derivation vs. Computation. 17-49 1994 70 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#HandleyW94 2004-02-19 Turning Cycles into Spirals. 57-73 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Carbone99a 2003-11-28 On free annotated algebras. 249-259 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#LewinMS01 2003-11-28 Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. 7-19 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#BeckmannP98 2003-11-28 Inseparability in Recursive Copies. 1-52 1994 68 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Davey94 2003-11-28 Universes over Frege structures. 191-223 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#Kahle03 2003-11-28 Normalization without reducibility. 121-130 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#David01 2003-11-28 On-Dimensional Groups over an o-Minimal Structure. 269-277 1991 53 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Razenj91 2003-11-28 Some Effectively Infinite Classes of Enumerations. 207-235 1993 60 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#GoncharovYY93 2003-11-28 Enumerators of lambda Terms are Reducing Constructively. 3-9 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Barendregt95 2003-11-28 The Covering Lemma up to a Woodin Cardinal. 219-255 1997 84 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#MitchellSS97 2003-11-28 Mints Type Deductive Calculi for Logic Programming. 7-17 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#Shepherdson92 2003-11-28 Retracts of Numerations. 225-242 1989 42 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Kanda89 2003-11-28 Cell Decompositions of C-Minimal Structures. 113-162 1994 66 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#HaskellM94 2003-11-28 On Borel Ideals. 177-203 1994 70 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#Engelen94 2003-11-28 On Speedable and Levelable Vector Spaces. 61-112 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#BauerleR94 2003-11-28 Extended Order-Generic Queries. 85-125 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#BelegradekST99 2003-11-28 Automorphisms in the PTIME-Turing Degrees of Recursive Sets. 139-152 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#HaughtS97 2003-11-28 Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization. 221-280 1996 79 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#BarendsenB96 2003-11-28 The Model Theory of Unitriangular Groups. 225-261 1994 68 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Belegradek94 2003-11-28 Equational Theories for Inductive Types. 175-217 1997 84 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Loader97 2003-11-28 Ramsey Ultrafilters and the Reaping Number - Con(r<u). 121-142 1990 49 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#GoldsternS90 2003-11-28 More on Cardinal Invariants of Boolean Algebras. 1-37 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#RoslanowskiS00 2003-11-28 Common Knowledge Revisited. 89-105 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#FaginHMV99 2003-11-28 On well-generated Boolean algebras. 1-50 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#BonnetR00 2003-11-28 ⁰₂Games). 181-193 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Tanaka91 2003-11-28 ₀and a Non-Standard Method. 41-49 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Tanaka97 2003-11-28 The Galvin-Prikry Theorem and Set Existence Axioms. 81-104 1989 42 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Tanaki89 2003-11-28 Functional Interpretations of Feasibly Constructive Arithmetic. 103-200 1993 63 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#CookU93 2003-11-28 Some Principles Related to Chang's Conjecture. 39-101 1989 45 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#DonderL89 2003-11-28 Interactive and probabilistic proof-checking. 325-342 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Trevisan00 2003-11-28 Notions of Density That Imply Representability in Algebraic Logic. 93-190 1998 91 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#AndrekaGMNS98 2003-11-28 Model completion of Lie differential fields. 49-85 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Yaffe01 2003-11-28 ₀. 49-62 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#DAquino93 2003-11-28 Pell Equations and Exponentiation in Fragments of Arithmetic. 1-34 1996 77 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#DAquino96 2003-11-28 The d.r.e. Degrees are Not Dense. 125-151 1991 55 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#CooperHLLS91 2003-11-28 The wholeness axiom and Laver sequences. 157-260 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#Corazza00 2003-11-28 Equational Theory of Positive Numbers with Exponentiation is Not Finitely Axiomatizable. 1-30 1990 49 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Gurevic90 2003-11-28 Degrees of Convex Dependence in Recursively Enumerable Vector Spaces. 31-47 1993 60 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Nevins93 2003-11-28 The Elementary Theory of e-free PAC Domains. 55-95 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#Razon00 2003-11-28 Iterated Extended Ultrapowers and Supercompactness without Choice. 179-194 1991 54 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Spector91 2003-11-28 ⁰₁Classes. 79-139 1993 59 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#CenzerDJS93 2003-11-28 Sometimes Slow Growing is Fast Growing. 91-99 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Weiermann97 2003-11-28 Subsystems of True Arithmetic and Hierarchies of Functions. 95-152 1993 64 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Ratajczyk93 2003-11-28 Polynomial-Time Analogues of Isolatedness. 173-182 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#Harkleroad92 2003-11-28 Full Intuitionistic Linear Logic (extended abstract). 273-291 1993 64 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#HylandP93 2003-11-28 Erratum to "Definitional Equivalence and Algebraizability of Generalized Logical Systems". 283-284 2000 102 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Pynko00 2003-11-28 Definitional Equivalence and Algebraizability of Generalized Logical Systems. 1-68 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Pynko99 2003-11-28 Projecting Sequential Algorithms on Strongly Stable Functions. 201-244 1996 77 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Ehrhard96 2003-11-28 Regularity Properties for Dominating Projective Sets. 291-307 1995 72 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#BrendleHS95 2003-11-28 Combinatorial Properties of Hechler Forcing. 185-199 1992 58 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#BrendleJS92 2003-11-28 Definable Properties of the Computably Enumerable Sets. 97-125 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#HarringtonS98 2003-11-28 Axiomatizing Higher-Order Kleene Realizability. 87-111 1994 70 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#Oosten94 2003-11-28 Extensional Realizability. 317-349 1997 84 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Oosten97 2003-11-28 Automorphism groups of differentially closed fields. 1-60 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Konnerth02 2003-11-28 Mouse Sets. 1-100 1997 87 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#Rudominer97a 2003-11-28 Reducts of Random Hypergraphs. 165-193 1996 80 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Thomas96 2003-11-28 Atom Structures of Cylindric Algebras and Relation Algebras. 117-148 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Hodkinson97 2003-11-28 A first order logic for specification of timed algorithms: basic properties and a decidable class. 13-52 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#BeauquierS01 2003-11-28 Completeness Results for Linear Logic on Petri Nets. 101-135 1997 86 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#EngbergW97 2003-11-28 Extending Partial Orders to Dense Linear Orders. 253-261 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#SlamanW98 2003-11-28 Dynamic Linear Time Temporal Logic. 187-207 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#HenriksenT99 2003-11-28 Large Cardinals and Definable Counterexamples to the Continuum Hypothesis. 47-97 1995 76 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#ForemanM95 2003-11-28 The Real Core Model and It Scales. 213-289 1995 72 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#Cunningham95 2003-11-28 Is There a Set of Reals Not in K(R)? 161-210 1998 92 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Cunningham98 2003-11-28 Relation algebras form cylindric algebras, II. 267-297 2001 112 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#HirschH01a 2003-11-28 A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element. 1-26 2001 112 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Englert01 2004-09-28 Generic Copies of Countable Structures. 195-205 1989 42 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#AshKMS89 2003-11-28 A Dichotomy Theorem for Regular Types. 157-169 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#HrushovskiS89 2003-11-28 The single-conclusion proof logic and inference rules specification. 181-206 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Krupski01 2003-11-28 A general theory of confluent rewriting systems for logic programming and its applications. 153-188 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#DixOZ01 2003-11-28 The Machinery of Consistency Proofs. 139-152 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Yasugi89 2003-11-28 ¹₂Wadge Degrees. 53-74 1996 77 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Hjorth96 2003-11-28 Mittag-Leffler Modules. 227-239 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Rothmaler97 2003-11-28 A Strong Boundedness Theorem for Dilators. 93-97 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#KechrisW91 2005-04-06 Inherently nonfinitely based lattices. 175-193 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#FreeseMN02 2003-11-28 Intrinsic reasoning about functional programs I: first order theories. 117-153 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Leivant02 2003-11-28 Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity. 209-229 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Leivant99 2003-11-28 Well-Ordering, Proofs for Martin-Löf Type Theory. 113-159 1998 92 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Setzer98 2003-11-28 Flatness and Smooth Points of p-adic Subanalytic Sets. 217-225 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Robinson97 2003-11-28 The complexity of subdifferentiation and its inverse on convex functions in Banach spaces. 197-217 2002 118 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Casevitz02 2003-11-28 Projective Geometries of Algebraically Closed Fields of Characteristic Zero. 237-260 1993 60 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Holland93 2003-11-28 Strongly Minimal Fusions of Vector Spaces. 1-22 1997 83 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#Holland97 2003-11-28 Intuitionistic logic and implicit definability. 83-102 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#Maksimova00 2003-11-28 Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies. 277-297 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#YakhnisY90 2003-11-28 Gurevich-Harrington's Games Defined by Finite Automata. 265-294 1993 62 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#YakhnisY93 2003-11-28 A Constructive Approach to Nonstandard Analysis. 297-325 1995 73 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Palmgren95 2003-11-28 A Sheaf-Theoretic Foundation for Nonstandard Analysis. 69-86 1997 85 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#Palmgren97 2003-11-28 Elementary Pairs of Models. 129-137 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Bouscaren89a 2003-11-28 Structure Theorems for o-Minimal Expansions of Groups. 159-181 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Edmundo00 2003-11-28 Logic of Proofs. 29-59 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#Artemov94 2003-11-28 Varieties of quasi-Stone algebras. 229-235 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Gaitan01 2003-11-28 Inductive Full Satisfaction Classes. 199-223 1990 47 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#KotlarskiR90 2003-11-28 Transfer Theorems for pi-Monads. 53-62 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Cutland89 2003-11-28 Recursive Unary Algebras and Trees. 213-268 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#Khoussainov94 2003-11-28 Randomness, Computability, and Algebraic Specifications. 1-15 1998 91 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#Khoussainov98 2003-11-28 A Boolean Model of Ultrafilters. 231-239 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#Coquand99 2003-11-28 On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case. 227-246 1989 45 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#BeigelG89a 2003-11-28 Elementary equivalence of infinite-dimensional classical groups. 103-155 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#Tolstykh00 2003-11-28 Nondeterministic Bounded Query Reducibilities. 107-118 1989 41 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#BeigelGO89 2003-11-28 On the expressibility and the computability of untyped queries. 345-371 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Torres01 2003-11-28 A Completeness Theorem for Open Maps. 51-86 1994 70 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#JoyalM94 2003-11-28 Nonaxiomatisability of Equivalences over Finite State Processes. 163-191 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Sewell97 2003-11-28 Modality, Bisimulation and Interpolation in Infinitary Logic. 29-41 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Benthem99 2003-11-28 How to Define a Linear Order on Finite Models. 241-267 1997 87 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#HellaKL97 2003-11-28 On o-Amorphous Sets. 185-226 2000 101 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#CreedT00 2003-11-28 Preface. 1-2 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#CenzerR98a 2003-11-28 ⁰₁Classes. 3-61 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#CenzerR98b 2003-11-28 Bounded forcing axioms and the continuum. 179-203 2001 109 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#AsperoB01 2003-11-28 The Woods-Erdös conjecture for polynomial rings. 331-344 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Vsemirnov01 2003-11-28 Stephen Cole Kleene - a Reminiscence. 3-7 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#LaneS96 2003-11-28 Structured Theory Presentations and Logic Representations. 113-160 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#HarperST94 2003-11-28 Primes and Their Residue Rings in Models of Open Induction. 57-77 1989 43 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#MacintyreM89 2003-11-28 On the Weak Distributivity Game. 19-26 1994 66 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Kamburelis94 2003-11-28 On Completeness and Cocompleteness in an Around Small Categories. 121-152 1995 74 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#Pavlovic95 2003-11-28 Shelah's pcf Theory and Its Applications. 207-254 1990 50 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#BurkeM90 2003-11-28 ₊₁] hierarchy. 227-238 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Laver01 2003-11-28 Implications Between Strong Large Cardinal Axioms. 79-90 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Laver97 2003-11-28 Non-Axiomatizable Second Order Intuitionistic Propositional Logic. 33-46 1997 86 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#Skvortsov97 2003-11-28 Effective Forcing versus Proper Forcing. 171-185 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#Sacks96 2003-11-28 A Method to Single out Maximal Propositional Logics with the Disjunction Property I. 1-46 1995 76 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#FerrariM95 2003-11-28 On the Size of Closed Unbounded Sets. 195-227 1991 54 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Baumgartner91 2003-11-28 Conservative translations. 205-227 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#FeitosaD01 2003-11-28 Strong Cardinals in the Core Model. 165-198 1997 83 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#HauserH97 2003-11-28 Projective Uniformization Revisited. 109-153 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#HauserS00 2003-11-28 Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. 35-62 1998 92 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#CourcelleW98 2003-11-28 Unidimensional Modules: Uniqueness of Maximal Non-Modular Submodels. 175-181 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#PillayR93 2003-11-28 Interpolating d-r.e. and REA Degrees between r.e. Degrees. 29-56 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#ArslanovLS96 2003-11-28 Rudimentary Kripke Models for the Intuitionistic Propositional Calculus. 21-49 1993 62 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Dosen93 2003-11-28 Sequent Reconstruction in LLM - A Sweepline Proof. 277-295 1995 73 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Banach95 2003-11-28 Inductive Types and Type Constraints in the Second-Order lambda Calculus. 159-172 1991 51 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Mendler91 2003-11-28 Third Order Matching is Decidable. 135-155 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Dowek94 2003-11-28 Partition subalgebras for maximal almost disjoint families. 223-259 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#DowmZ02 2003-11-28 Maslov's Inverse Method and Decidable Classes. 165-194 1989 42 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Zamov89 2003-11-28 Syntactic Characterizations of Closure Under Pullbacks and of Locally Polypresentable Categories. 73-95 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Hebert97 2003-11-28 Arithmetic complexity of the predicate logics of certain complete arithmetic theories. 243-259 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Plisko01 2003-11-28 Theories of Generalized Pascal Triangles. 45-52 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Korec97 2003-11-28 Preface - Invited papers presented at the 1992 IEEE Symposium on Logic in Computer Science. 133 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Scedrov94 2003-11-28 ₀? A Survey of Some Results in Proof Theory. 199-260 1991 53 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Gallier91 2003-11-28 ₀? A Survey of Some Results in Proof Theory''. 275 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Gallier97 2003-11-28 Typing Untyped lambda-Terms, or Reducibility Strikes Again! 231-270 1998 91 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal91.html#Gallier98 2003-11-28 A Note on Full Intuitionistic Linear Logic. 281-287 1996 79 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Bierman96 2003-11-28 Apartness spaces as a framework for constructive topology. 61-83 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#BridgesD03 2003-11-28 Generic Structures and Simple Theories. 71-92 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#ChatzidakisP98 2003-11-28 Sparse Parameterized Problems. 1-15 1996 82 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#CesatiF96 2003-11-28 Dimension of Definable Sets, Algebraic Boundedness and Henselian Fields. 189-209 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Dries89 2003-11-28 ^b₁¹₂²₂? 79-88 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Ferreira95 2003-11-28 Extended Bar Induction in Applicative Theories. 139-189 1990 50 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Lavalette90 2003-11-28 Some conservation results on week König's lemma. 87-114 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#SimpsonTY02 2003-11-28 The Structure of Models of Decidable Monadic Theories of Graphs. 169-195 1991 53 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Seese91 2003-11-28 ₅and the contiguous degrees. 151-188 2001 112 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Ambos-SpiesF01 2003-11-28 The Recursively Enumerable Degrees have Infinitely Many One-Types. 1-23 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Ambos-SpiesS89 2003-11-28 Undecidability and 1-Types in the Recursively Enumerable Degrees. 3-37 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Ambos-SpiesS93 2003-11-28 Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams. 75-113 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#Feferman96 2003-11-28 Logarithmic-exponential series. 61-113 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#DriesMM01 2003-11-28 _maxaxiom(*). 135-149 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#Larson00 2003-11-28 Martin's Axiom and Ordinal Graphs: Large Independent Sets or Infinite Paths. 31-39 1990 47 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Larson90 2003-11-28 Axioms and (counter) examples in synthetic domain theory. 233-278 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#OostenS00 2003-11-28 Preface. 1-2 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#OostenS02 2003-11-28 Critical Points in an Algebra of Elementary Embeddings. 211-241 1993 65 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#Dougherty93 2003-11-28 Narrow Coverings of omega-ary Product Spaces. 47-91 1997 88 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Dougherty97 2003-11-28 The name for Kojman-shelah collapsing function. 131-137 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#BalcarS01 2003-11-28 Proof theory in the abstract. 43-78 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Hyland02 2003-11-28 Forcing with Filters and Complete Combinatorics. 125-163 1989 42 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Laflamme89 2003-11-28 Dimensional Order Property and Pairs of Models. 205-231 1989 41 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Bouscaren89 2003-11-28 Inaccessibility in Constructive Set Theory and Type Theory. 181-200 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#RathjenGP98 2003-11-28 On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case. 1-38 1989 45 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#BeigelG89 2003-11-28 Diophantine Undecidability in Some Rings of Algebraic Numbers of Totally Real Infinite Extensions of Q. 299-325 1994 68 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Shalpentokh94 2003-11-28 The Analytical Completeness of Dzhaparidze's Polymodal Logics. 95-111 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Boolos93 2003-11-28 The logic of tasks. 261-293 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#Japaridze02 2003-11-28 A Constructive Game Semantics for the Language of Linear Logic. 87-156 1997 85 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#Japaridze97 2003-11-28 Models for the Lambek Calculus. 179-213 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Pentus95 2003-11-28 There is no recursive link between the k-size of a model and its cardinality. 235-247 2002 118 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Barker02 2003-11-28 Back and Forth Relations for Reduced Abelian p-Groups. 223-249 1995 75 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Barker95 2003-11-28 Relative Elimination of Quantifiers for Henselian Valued Fields. 51-74 1991 53 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#Basarab91 2003-11-28 Polynomial Games and Determinacy. 1-16 1996 80 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Yamakami96 2003-11-28 Cardinal Invariants Above the Continuum. 251-268 1995 75 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#CummingsS95 2003-11-28 The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. 305-324 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Strahm00 2003-11-28 Safe recursion with higher types and BCK-algebra. 113-166 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Hofmann00 2005-07-06 A Natural Prior Probability Distribution Derived from the Propositional Calculus. 243-285 1994 70 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#ParisVW94 2003-11-28 ₀. 63-69 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#KurataS89 2003-11-28 Nonbounding and Slaman Triples. 139-163 1996 79 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Leonhardi96 2003-11-28 A contrast to the low basis theorem. 203-207 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#Lippe02 2003-11-28 An Infinitary Ramsey Property. 151-160 1992 57 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#Mitchell92 2003-11-28 The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete. 53-58 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Beltiukov01 2003-11-28 Intuitionistic Formal Theories with Realizability in Subrecursive Classes. 3-15 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Beltiukov97 2003-11-28 Zilber's Conjecture for Some o-Minimal Structures over the Reals. 223-239 1993 61 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Peterzil93 2003-11-28 Sandwiches of ages. 295-326 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#PouzetS01 2003-11-28 ^-a^-epsilon^{^epsilon}) for Some epsilon>0. 97-102 1996 82 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#Shelah96a 2003-11-28 Was Sierpinski Right? III: Can Continuum-cc. Times c.c.c. be Continuum-c.c.? 259-269 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#Shelah96b 2003-11-28 On the Existence of Regular Types. 277-308 1989 45 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#ShelahB89 2003-11-28 _{k omega}, with k a Compact Ordinal. 41-97 1990 47 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#ShelahM90 2003-11-28 On Distinguishing Quotients of Symmetric Groups. 47-83 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#ShelahT99 2003-11-28 Almost free groups and Ehrenfeucht-Fraïssé games for successors of singular cardinals. 147-173 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#ShelahV02 2003-11-28 Toward Categoricity for Classes with no Maximal Models. 1-25 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#ShelahV99 2003-11-28 ₁-Combinatorics. 217-259 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#ShelahZ99 2003-11-28 Simplifying von Plato's Axiomatization of Constructive Apartness Geometry. 1-26 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#DafaJL00 2003-11-28 Preface: A Selection of Papers Presented at the "Stability in Model Theory III" Conference. 81 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Baldwin93 2003-11-28 Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface. 101-102 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#Shore97 2003-11-28 On the Proof-Theoretic Strength of Monotone Induction in Explicit Mathematics. 1-46 1997 85 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal85.html#GlassRS97 2004-10-25 ₂⁰- categoricity in Boolean algebras and linear orderings. 85-120 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#McCoy03 2003-11-28 Linearizing Intuitionistic Implication. 151-177 1993 60 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#LincolnSS93 2003-11-28 Maximal Kripke-Type Semantics for Modal and Superintuitionistic Predicate Logics. 69-101 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#SkvortsovS93 2003-11-28 Complexity of Reals in Inner Models of Set Theory. 283-295 1998 92 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#VelickovicW98 2003-11-28 On subvarieties of symmetric closure algebras. 137-152 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Varela01 2003-11-28 Basis problem for turbulent actions I: Tsirelson submeasures. 189-203 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Farah01 2003-11-28 Linear Heyting algebras with a quantifier. 327-343 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Rueda01 2003-11-28 Behaviorism and Belief. 75-88 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Collins99 2003-11-28 Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata. 243-268 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Klarlund94 2003-11-28 Preface - Papers presented at the International Symposium on Mathematical Logic and its Applications Nagoya, Japan, November 7-11, 1988. 1 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#ShinodaT91 2003-11-28 Strong Splitting in Stable Homogeneous Models. 201-228 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#HyttinenS00 2003-11-28 Constructing Strongly Equivalent Nonisomorphic Models for Unstable Theories. 203-248 1991 52 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#HyttinenT91 2003-11-28 Borel Ideals vs. Borel Sets of Countable Relations and Trees. 161-195 1989 43 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Zafrany89 2003-11-28 Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle. 289-316 1996 79 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#DzamonjaS96 2003-11-28 On a finitary version of mathematical analysis. 261-295 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Shanin01 2003-11-28 The Number of Types in Simple Theories. 69-86 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Casanovas99 2003-11-28 Some model-theoretic results in the algebrais theory of quadratic forms. 189-223 2001 112 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#Astier01 2003-11-28 On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System. 251-276 1992 57 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#ToninoF92 2003-11-28 Universal Theories Categorical in Power and kappa-Generated Models. 27-51 1994 69 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#GivantS94 2003-11-28 Locally Finite Weakly Minimal Theories. 153-203 1991 55 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#Loveys91 2003-11-28 Proof of a Conjecture of S. Mac Lane. 101-162 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Soloviev97 2003-11-28 Inaccessible set axions may have little consistency strength. 33-70 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#CrosillaR02 2003-11-28 An Intuitionistic Theory of Types with Assumptions of High-Arity Variables. 93-149 1992 57 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#BossiV92 2003-11-28 Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis I. 125-151 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#KalantariW98 2003-11-28 Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II. 87-110 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#KalantariW99 2003-11-28 Combinatorics and Forcing with Distributive Ideals. 137-201 1997 86 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal86.html#Matet97 2003-11-28 Complexity of Null-and Positivstellensatz proofs. 153-160 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#GrigorievV01 2003-11-28 A Constructive Logic Behind the Catch and Throw Mechanism. 269-301 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Nakano94 2003-11-28 Some Highly Undecidable Lattices. 41-63 1990 46 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#MagidorRRS90 2003-11-28 Minimal Coding. 233-297 1989 41 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Friedman89 2003-11-28 A Simpler proof of Jensen's Coding Theorem. 1-16 1994 70 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#Friedman94 2003-11-28 Logic of proofs and provability. 345-372 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Yavorskaya01 2003-11-28 Difference Sets and Computability Theory. 63-72 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#DowneyFJR98 2003-11-28 A Method to Single out Maximal Propositional Logics with the Disjunction Property II. 117-168 1995 76 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#FerrariM95a 2003-11-28 Every Borel Function is Monotone Borel. 87-99 1991 54 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Zivaljevic91 2003-11-28 A Diamond Example of an Ordinal Graph with No Infinite Paths. 1-10 1990 47 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#BaumgartnerL90 2003-11-28 ₁-Interpolability. 1-25 1993 64 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Ignatiev93 2003-11-28 ⁺- class by an a posteriori, liftable order. 219-232 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Nivelle00 2003-11-28 Finite methods in 1-order formalisms. 121-151 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Gordeev01 2003-11-28 Existential Instantiation and Normalization in Sequent Natural Deduction. 111-148 1992 58 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#Celluci92 2003-11-28 Lattice Representations for Computability Theory. 53-74 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Fejer98 2003-11-28 Regressive Partition Relations, n-Subtle Cardinals, and Borel Diagonalization. 65-77 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Kanamori91 2003-11-28 Omega-Categoricity, Relative Categoricity and Coordinatisation. 169-199 1990 46 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#HodgesHM90 2003-12-12 ^*16.5.1935). 1-8 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Sochor01 2003-11-28 On Relative Randomness. 61-67 1993 63 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Kucera93 2003-11-28 Nonstandard Definability. 21-43 1989 42 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#Smith89 2003-11-28 Decidable fragment of first-order temporal logics. 85-134 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#HodkinsonWZ00 2005-11-10 Universes in explicit mathematics. 141-162 2001 109 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#JargerKS01 2003-11-28 Rationality of p-adic Poincaré Series: Uniformity in p. 31-74 1990 49 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Macintyre90 2003-11-28 Schanuel's Conjecture and Free Exponential Rings. 241-246 1991 51 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Macintyre91 2003-11-28 Generic Automorphisms of Fields. 165-180 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Macintyre97 2003-11-28 _maxmodels. 121-190 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#FengW03 2003-11-28 Sequential Evaluation Strategies for Parallel-Or and Related Reduction Systems. 31-56 1989 43 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Kennaway89 2003-11-28 Some orbits for E. 193-226 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#CholakDH01 2003-11-28 Cardinalities of Topologies with Small Base. 95-113 1994 68 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Shelah94 2003-11-28 Toward Classifying Unstable Theories. 229-255 1996 80 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Shelah96 2003-11-28 ₂-C.C. 153-174 1997 84 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Shelah97 2003-11-28 Categoricity for Abstract Classes with Amalgamation. 261-294 1999 98 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal98.html#Shelah99 2003-11-28 On the weak Freese-Nation property of complete Boolean algebras. 89-105 2001 110 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal110.html#FuchinoGSS01 2003-11-28 Doing logic b computer: interpolation in fragments ofinstuitionistic propositional logic. 97-112 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Hendriks00 2003-11-28 More exact completions that are toposes. 187-203 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Menni02 2003-11-28 Strictly orthogonal left linear rewrite systems and primitive recursion. 79-101 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#CichonB01 2003-11-28 Term Rewriting Theory for the Primitive Recursive Functions. 199-223 1997 83 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#CichonW97 2003-11-28 Belief Revision Conditionals: Basic Iterated Systems. 3-28 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Arlo-Costa99 2003-11-28 Sub-Arithmetical Ultrapowers: A Survey. 143-191 1990 49 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#McLaughlin90 2003-11-28 Eight Problems about Nerode Semirings (Recursive Ultrapowers). 137-146 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#McLaughlin92 2003-11-28 A Data Type Variety of Stack Algebras. 11-36 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#BergstraT95 2003-11-28 Sets of Generators and Automorphism Bases for the Enumeration Degrees. 263-272 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Sorbi98 2003-11-28 Compactness and Normality in Abstract Logics. 33-43 1993 59 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Caicedo93 2003-11-28 Analytic Ideals and Their Applications. 51-72 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#Solecki99 2003-11-28 Normal forms for connectedness in categories. 237-247 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Gutierrez01 2003-11-28 Borel Quasi-Orderings in Subsystems of Second-Order Arithmetic. 265-291 1991 54 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Marcone91 2003-11-28 Problems of Substitution and Admissibility in the Modal System Grz and in Intuitionistic Propositional Calculus. 71-106 1990 50 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#Rybakov90 2003-11-28 Changing the Heights of Automorphism Towers. 139-157 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#HamkinsT00 2003-11-28 On the Unity of Logic. 201-217 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Girard93 2003-11-28 Classification Theory through Stationary Logic. 27-68 2000 102 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Appenzeller00 2003-11-28 Constructions by Transfinitely Many Workers. 237-259 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#Knight90 2003-11-28 Coding a Family of Sets. 127-142 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Knight98 2003-11-28 Finite Notations for Infinite Terms. 201-222 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Schwichtenberg98 2003-11-28 Ordinals and Ordinal Functions Representable in the Simply Typed lambda Calculus. 179-201 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#Danner99 2003-11-28 Weakly Minimal Formulas: A Global Approach. 65-94 1990 46 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#Newelski90 2003-11-28 Meager Forking. 141-175 1994 70 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal70.html#Newelski94 2003-11-28 A Model and Its Subset: The Uncountable Case. 107-129 1995 71 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Newelski95 2003-11-28 Algebraic properties of rings of generalized power series. 39-66 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Pitteloud02 2003-11-28 A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems. 269-323 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#MarekNR94 2003-11-28 Logic Programs, Well-Orderings, and Forward Chaining. 231-276 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#MarekNR99 2003-11-28 ¹₂-Sets of Reals. 207-223 1989 42 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#IhodaS89 2003-11-28 ₀- categorical structures with a predimension. 157-186 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Evans02 2003-11-28 Finite Covers with Finite Kernels. 109-147 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Evans97 2003-11-28 Reduction of finite and infinite derivations. 167-188 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#Mints00 2003-11-28 Interpolation theorems for intuitionistic predicate logic. 225-242 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Mints01 2003-11-28 A Normal Form for Logical Derivations Implying One for Arithmetic Derivations. 65-79 1993 62 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Mints93 2003-11-28 The Notion of Independence in Categories of Algebraic Structures, Part III: Equational Classes. 269-294 1990 47 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Srour90 2003-11-28 Dynamical method in algebra: effective Nullstellensätze. 203-256 2001 111 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#CosteLR01 2003-11-28 Kripke-Style Models for Typed lambda Calculus. 99-124 1991 51 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#MitchellM91 2003-11-28 Strongly Determined Types. 197-230 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#IvanovM99 2003-11-28 Realism, nonstandard set theory, and large cardinals. 15-48 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Hrbacek01 2003-11-28 Bounded Arithmetic for NC, ALogTIME, L and NL. 73-117 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#CloteT92 2003-11-28 Definable Homomorphisms of Abelian Groups in oMminimal Structures. 1-27 1999 101 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#PeterzilS99 2003-11-28 Model Theory of Modules Over a Serial Ring. 145-176 1995 72 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#EklofH95 2003-11-28 Inner Models with Many Woodin Cardinals. 185-209 1993 65 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#Steel93 2003-11-28 Projectively Well-Ordered Inner Models. 77-104 1995 74 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#Steel95 2003-11-28 Real Numbers, Continued Fractions and Complexity Classes. 1-28 1990 50 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#LabhallaL90 2003-11-28 Classical Logic, Storage Operators and Second-Order lambda-Calculus. 53-78 1994 68 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Krivine94 2003-11-28 Indiscernible Sequences for Extenders, and the Singular Cardinal Hypothesis. 273-316 1996 82 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#GitikM96 2003-11-28 ^_n^_omega. 193-241 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#GitikM97 2003-11-28 More on Simple Forcing Notions and Forcings with Ideals. 219-238 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#GitikS93 2003-11-28 delta-homomorphisms from the Borel delta-algebra into the Loeb delta-algebra. 15-21 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#Render01 2003-11-28 A Type-Free System Extending (ZFC). 79-97 1989 43 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#MyhillF89 2003-11-28 Succinctness as a Source of Complexity in Logical Formalisms. 231-260 1999 97 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal97.html#GottlobLV99 2003-11-28 The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs. 193-255 1990 49 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Courcelle90 2003-11-28 The Monadic Second-Order Logic of Graphs VIII: Orientations. 103-143 1995 72 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#Courcelle95 2003-11-28 Models with Second Order Properties V: A General Principle. 169-194 1993 64 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#ShelahLH93 2003-11-28 Infima in the d.r.e. Degrees. 207-263 1993 62 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#Kaddah93 2003-11-28 Choiceless Polynomial Time. 141-187 1999 100 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal100.html#BlassGS99 2003-11-28 A Note on Applicability of the Incompleteness Theorem to Human Mind. 335-342 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Pudlak99 2003-11-28 Combinatorial principle in nonstandard analysis. 265-293 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#NassoH03 2003-11-28 Completeness Results for Intuitionistic and Modal Logic in a Categorical Setting. 25-101 1995 72 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#MakkaiR95 2003-11-28 Contraction-Elimination for Implicational Logics. 17-39 1997 84 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal84.html#Kashima97 2003-11-28 How to Win Some Simple Iteration Games. 103-164 1997 83 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#AndrettaS97 2003-11-28 The generic filter property in nonstandard analysis. 23-37 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#Nasso01 2003-11-28 ₀and Stone's Separation Theorem for Convex Sets. 245-249 1996 77 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Hatzikiriakou96 2003-11-28 Papers presented at the Meeting on "Stability in Model Theory II", July 13-17, 1987, Trento, Italy - Preface. 103 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#BaldwinM89 2003-11-28 Semisimple Stable and Superstable Groups. 105-127 1989 45 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#BaldwinP89 2003-11-28 The Primal Framework I. 235-264 1990 46 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#BaldwinS90 2003-11-28 The Primal Framework II: Smoothness. 1-34 1991 55 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#BaldwinS91 2003-11-28 Stable Generic Structures. 1-35 1996 79 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#BaldwinS96 2003-11-28 Generic Degrees are Complemented. 257-272 1993 59 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal59.html#Kumabe93 2003-11-28 Separations of Theories in Weak Bounded Arithmetic. 47-67 1995 71 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Takeuti95 2003-11-28 Semimorasses and Nonreflection at Singular Cardinals. 1-23 1995 72 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal72.html#Koszmider95 2003-11-28 Back-and-forth systems for generic curves and a decision algorithm for the limit theory. 257-275 2001 111 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#KoiranP01 2003-11-28 On second-order generalized quantifiers and finite structures. 1-32 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#Andersson02 2003-11-28 ^omega^{omega omega}. 247-276 1989 45 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal45.html#Dordal89 2003-11-28 Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability. 149-209 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Andreka97 2003-11-28 Transfinite Induction within Peano Arithmetic. 231-289 1995 76 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#Sommer95 2003-11-28 ₂₁. 83-101 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#GroszekH98 2003-11-28 Isomorphism Property in Nonstandard Extensions of the ZFC Universe. 1-25 1997 88 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#KanoveiR97 2003-11-28 Higher type recursion, ramification and polynomial time. 17-30 2000 104 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal104.html#BellantoniNS00 2003-11-28 Automata techniques for query inference machines. 169-201 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#GasarchH02 2003-11-28 On the Finiteness of the Recursive Chromatic Number. 73-81 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#GasarchL98 2003-11-28 Determinacy and the Sharp Functions on the Reals (Corrected Version). 237-263 1992 55 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#DuBose92a 2003-11-28 The Complexity of Horn Fragments of Linear Logic. 195-241 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Kanovich94 2003-11-28 Petri Nets, Horn Programs, Linear Logic and Vector Games. 107-135 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Kanovich95 2003-11-28 Linear Logic Automata. 147-188 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#Kanovich96 2003-11-28 Zero-One Laws for Modal Logic. 157-193 1994 69 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#HalpernK94 2003-11-28 Order Types of Free Subsets. 75-83 1997 89 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Mildenberger97 2006-02-20 Using the prover ANDP to simplify orthogonality. 49-70 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00051-4 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#Li03 2003-11-28 ₁⁰- sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. 227-271 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Visser02 2003-11-28 A Course on Bimodal Provability Logic. 109-142 1995 73 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Visser95 2003-11-28 Relative and modified relative realizability. 115-132 2002 118 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#BirkedalO02 2003-11-28 Complexity-Theoretic Algebra II: Boolean Algebras. 71-99 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#NerodeR89 2003-11-28 On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field. 125-170 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#NerodeR96 2003-11-28 Preface - Special Volume Dedicated to the late Stephen Cole Kleene. 1 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#NerodeS96 2003-11-28 A Selection of Papers Presented at the Symposium "Logic at Tver '92" - Preface. 1 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#NerodeT94 2003-11-28 Dominoes and the Complexity of Subclasses of Logical Theories. 1-30 1989 43 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Gradel89 2003-11-28 Density Zero Slaloms. 39-53 2000 103 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal103.html#Pawlikowski00 2003-11-28 Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding. 153-172 1989 44 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Downey89a 2003-11-28 Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees. 97-119 1990 49 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal49.html#Downey90a 2003-11-28 There is No Fat Orbit. 277-289 1996 80 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#DowneyH96 2003-11-28 Classification of Degree Classes Associated with r.e. Subspaces. 105-124 1989 42 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal42.html#DowneyR89 2003-11-28 Completely Mitotic r.e. Degrees. 119-152 1989 41 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#DowneyS89 2003-11-28 On co-Simple Isols and Their Intersection Types. 221-237 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#DowneyS92 2003-11-28 Splitting Theorems in Recursion Theory. 1-106 1993 65 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#DowneyS93 2003-11-28 Splitting Theorems and the Jump Operator. 45-52 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#DowneyS98 2003-11-28 A Rank one Cohesive Set. 161-171 1994 68 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#DowneyY94 2003-11-28 Neocompact quantifier elimination in structures based on Banach spaces. 115-143 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#BaratellaN01 2003-11-28 Approximation Methods in Inductive Inference. 217-253 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#Moser98 2003-11-28 Parametrization over Inductive Relations of a Bounded Number of Variables. 103-134 1990 48 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#McColm90 2003-11-28 Combinatorial Principle in the Core Model for one Woodin Cardinal. 153-201 1995 74 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#Schimmerling95 2003-11-28 MAX SAT approximation beyond the limits of polynomial-time approximation. 81-94 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#DantsinGHK01 2003-11-28 Countable Valued Fields in Weak Subsystems of Second-Order Arithmetic. 27-32 1989 41 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#HatzikiriakouS89 2003-11-28 Preface. 1- 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Matiyasevich01 2003-11-28 A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations. 325-348 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#Matiyasevich94 2003-11-28 ¹₃Sets of Reals. 1-25 1994 69 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#Bagaria94 2003-11-28 A General Model Completeness Result for Expansions of the Real Ordered Field. 185-227 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#Maxwell98 2004-12-10 Decision Problems for Propositional Linear Logic. 239-311 1992 56 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal56.html#LincolnMSS92 2003-11-28 A general condition for collapse results. 323-330 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Taitslin01 2003-11-28 Subtle cardinals and linear orderings. 1-34 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Freidman01 2003-11-28 Relation Algebras with n-Dimensional Relational Bases. 227-274 2000 101 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal101.html#HirschH00 2003-11-28 Relation algebras form cylindric algebras, I. 225-266 2001 112 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal112.html#HirschH01 2003-11-28 Boundedness Theorems for Dilators and Ptykes. 79-92 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Kechris91 2003-11-28 On Grzegorczyk Induction. 1-21 1995 74 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal74.html#Cornaros95 2003-11-28 Large Ideals on Small Cardinals. 241-271 1993 64 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Huberich93 2003-11-28 ₁⁰classes and orderable groups. 279-302 2002 115 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal115.html#Solomon02 2003-11-28 Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels. 187-239 1996 81 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal81.html#LiptonO96 2003-11-28 From Discrete to Continuous Time. 99-141 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Keisler91 2003-11-28 Logical problems of functional interpretations. 27-42 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Diller02 2003-11-28 Injecting Inconsistencies into Models of PA. 101-132 1989 44 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Solovay89 2003-11-28 RRC-Fields with Small Absolute Galois Groups. 197-208 1989 43 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Ershov89 2003-11-28 Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. 195-221 1993 61 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#CholakD93 2003-11-28 Infinitesimal Approach of Almost-Automorphic Functions. 283-297 1993 63 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Peraire93 2003-11-28 An Omitting Types Theorem for Saturated Structures. 113-118 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#GreifL93 2003-11-28 Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. 269-311 1995 75 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#NiesS95 2003-11-28 Blowing up power of a lingual cardinal - wider gaps. 1-38 2002 116 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal116.html#Gitik02 2003-11-28 On gaps under GCH type assumptions. 1-18 2003 119 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal119.html#Gitik03 2003-11-28 ⁺⁺. 209-234 1989 43 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Gitik89 2003-11-28 The Strength of the Failure of the Singular Cardinal Hypothesis. 215-240 1991 51 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Gitik91 2003-11-28 On Measurable Cardinals Violating the Continuum Hypothesis. 227-240 1993 63 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal63.html#Gitik93 2003-11-28 Blowing Up the Power of a Singular Cardinal. 17-33 1996 80 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#Gitik96 2003-11-28 ^omega-Terms. 153-178 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Niggl95 2003-11-28 ^omegaConsidered as a Programming Language. 73-92 1999 99 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal99.html#Niggl99 2003-11-28 Ranks and pregeometries in finite diagrams. 49-82 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#Lessmann00 2003-11-28 On Variants of o-Minimality. 165-209 1996 79 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#MacphersonS96 2003-11-28 Minimal Collapsing Extensions of Models of ZFC. 265-298 1990 46 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal46.html#BukovskyC90 2003-11-28 Fallen cardinals. 117-129 2001 109 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#KojmanS01 2003-11-28 The Universality Spectrum of Stable Unsuperstable Theories. 57-72 1992 58 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal58.html#KojmanS92 2003-11-28 Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density. 1-26 1989 41 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Downey89 2003-11-28 _infty) and Other Lattices of r.e. Substructures''. 299-301 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#Downey90 2003-11-28 Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms. 193-206 1993 60 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal60.html#Downey93 2003-11-28 On the Undecidability of Some Classes of Abelian-by-Finite Groups. 167-173 1993 62 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal62.html#MarcjaPT93 2003-11-28 Modules in the category of sheaves over quantales. 103-136 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#ConiglioM01 2003-11-28 Exact Upper Bounds and Their Uses in Set Theory. 267-282 1998 92 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Kojman98 2003-11-28 Groups of Dimension Two and Three Over o-Minimal Structures. 279-296 1991 53 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal53.html#NesinPR91 2003-11-28 On the Semantics of the Universal Quantifier. 209-239 1997 87 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#Cubric97 2003-11-28 Applications of Cohomology to Set Theory I: Hausdorff Gaps. 69-106 1995 71 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal71.html#Talayco95 2003-11-28 Applications of Cohomology to Set Theory II: Todorcevic Trees. 279-299 1996 77 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal77.html#Talayco96 2003-11-28 Understanding Uniformity in Feferman's Explicit Mathematics. 89-106 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Glass95 2003-11-28 The Structure of Amorphous Sets. 191-233 1995 73 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Truss95 2003-11-28 On the Number of Steps in Proofs. 153-178 1989 41 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal41.html#Krajicek89 2003-11-28 Exponentiation and Second-Order Bounded Arithmetic. 261-276 1990 48 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#Krajicek90 2003-11-28 A Categorical Approach to the Theory of Computation. 293-305 1989 43 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Mulry89 2006-02-09 ₂₂Coding and the Jump Operator. 103-116 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#ChongY97a 2003-11-28 lambda-Definability on Free Algebras. 279-300 1991 51 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Zaionc91 2003-11-28 Ten Questions and One Problem on Fuzzy Logic. 157-165 1999 96 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal96.html#Hajek99 2003-11-28 Dominating Projective Sets in the Baire Space. 327-342 1994 68 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal68.html#Spinas94 2003-11-28 Partition Numbers. 243-262 1997 90 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal90.html#Spinas97 2003-11-28 A Generalized Notion of Weak Interpretability and the Corresponding Modal Logic. 113-160 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Dzhaparidze93 2003-11-28 The Logic of Arithmetical Hierarchy. 89-112 1994 66 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#Dzhaparidze94 2003-11-28 In Conjunction with Qualitative Probability. 217-234 1998 92 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Fernando98 2003-11-28 ₁₁Sentences and Degrees of Interpretability. 175-193 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Lindstrom93 2003-11-28 Extremes in the Degrees of Inferability. 231-276 1994 66 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#FortnowGJKKKPSSS94 2003-11-28 Superstable Quasi-Varieties. 53-71 1994 69 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal69.html#HartS94 2003-11-28 Observations about Scott and Karp Trees. 201-230 1995 76 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal76.html#Huuskonen95 2003-11-28 End Extensions of Models of Linearly Bounded Arithmetic. 263-277 1997 88 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal88.html#Zambella97 2003-11-28 Game-Theoretic Inductive Definability. 265-306 1993 65 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal65.html#OikkonenV93 2003-11-28 Post Complete and 0-Axiomatizable Modal Logics. 121-144 1990 47 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal47.html#Bellissima90 2003-11-28 Fixed points and unfounded chains. 163-178 2001 109 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#Bernardi01 2003-11-28 The topological complexity of a natural class of norms on Banach spaces. 3-13 2001 111 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#GodefroyYK01 2003-11-28 Saturated models of universal theories. 219-234 2002 118 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal118.html#Avigad02 2003-11-28 Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic. 165-191 1996 82 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#Avigad96 2003-11-28 _<omega. 1-34 1998 92 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal92.html#Avigad98 2003-11-28 On calculational proofs. 207-224 2001 113 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal113.html#Lifschitz01 2003-11-28 Woodin Cardinals and Presaturated Ideals. 285-303 1992 55 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal55.html#Goldring92 2003-11-28 Learning via Queries and Oracles. 273-296 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Stephan98 2003-11-28 Partition Properties and Well-Ordered Sequences. 81-101 1990 48 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal48.html#Jackson90 2003-11-28 On NP-Completeness in Linear Logic. 137-152 1995 75 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal75.html#Kopylov95 2003-11-28 Computing Definite Logic Programs by Partial Instantiation. 161-182 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#KaganNS94 2003-11-28 An Exponential Separation Between the Parity Principle and the Pigeonhole Principle. 195-228 1996 80 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal80.html#BeameP96 2003-11-28 Decidable Kripke Models of Intuitionistic Theories. 115-123 1998 93 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal93.html#IshiharaKN98 2003-11-28 Combinatorial Properties of Classical Forcing Notions. 143-170 1995 73 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal73.html#Brendle95 2003-11-28 Refined program extraction form classical proofs. 3-25 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#BergerBS02 2003-11-28 Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join. 193-219 1996 82 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal82.html#GlassS96 2003-11-28 Rational Separability over a Global Field. 93-108 1996 79 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal79.html#Shlapentokh96 2003-11-28 Verification of Concurrent Programs: The Automata-Theoretic Framework. 79-98 1991 51 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Vardi91 2003-11-28 Weak Presentations of Non-Finitely Generated Fields. 223-252 1998 94 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal94.html#Shlapentokh98 2003-11-28 Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations. 211-229 1997 89 Ann. Pure Appl. Logic 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal89.html#Andreka97a 2003-11-28 Definability Hierarchies of Generalized Quantifiers. 235-271 1989 43 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal43.html#Hella89 2003-11-28 Things That Can and Things That Cannot Be Done in PRA. 223-245 2000 102 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#Kohlenbach00 2003-11-28 On uniform weak König's lemma. 103-116 2002 114 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal114.html#Kohlenbach02 2003-11-28 Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation. 27-94 1993 64 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Kohlenbach93 2003-11-28 On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness. 257-285 1998 95 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal95.html#Kohlenbach98 2003-11-28 Domain Representability of Metric Spaces. 225-247 1997 83 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal83.html#Blanck97 2003-11-28 Focussing and proof construction. 131-163 2001 107 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal107.html#Andreoli01 2003-11-28 Essentially periodic ordered groups. 261-290 2000 105 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal105.html#PointW00 2003-11-28 The sequentially realizable functionals. 1-93 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#Longley02 2003-11-28 On Phase Semantics and Denotational Semantics in Multiplicative-Additive Linear Logic. 247-282 2000 102 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal102.html#BucciarelliE00 2003-11-28 On phase semantics and denotational semantics: the exponentials. 205-241 2001 109 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal109.html#BucciarelliE01 2003-11-28 Some remarks on Schanuel's conjecture. 15-18 2001 108 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal108.html#Bianconi01 2003-11-28 Model Completeness Results for Elliptic and Abelian Functions. 121-136 1991 54 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Bianconi91 2003-11-28 Combining Type Disciplines. 197-230 1994 66 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal66.html#CardoneDd94 2003-11-28 Topics in invariant descriptive set theory. 145-184 2001 111 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal111.html#Becker01 2003-11-28 On Recursively Enumerable Structures. 243-258 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#Selivanov96 2003-11-28 Complete Topoi Representing Models of Set Theory. 1-26 1992 57 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#BlassS92 2003-11-28 Large Cardinals and Iteration Trees of Height omega. 1-15 1991 54 Ann. Pure Appl. Logic 1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal54.html#Andretta91 2003-11-28 The Borel Conjecture. 255-269 1990 50 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal50.html#JudahSW90 2003-11-28 ⁰_aClasses and Minimal Degrees. 117-144 1997 87 Ann. Pure Appl. Logic 2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal87.html#GroszekS97a 2003-11-28 Moderate Families in Boolean Algebras. 217-250 1992 57 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal57.html#Heindorf92 2003-11-28 A Unification-Theoretic Method for Investigating the k-Provability Problem. 173-214 1991 51 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal51.html#Farmer91 2003-11-28 A Simple Type Theory with Partial Functions and Subtypes. 211-240 1993 64 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal64.html#Farmer93 2003-11-28 Linear Logic for Nets with Bounded Resources. 3-28 1996 78 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal78.html#ArchangelskyDT96 2003-11-28 Varieties of Complex Algebras. 173-242 1989 44 Ann. Pure Appl. Logic 3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal44.html#Goldblatt89 2003-11-28 ₁Conservativeness Problem. 3-48 1993 61 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal61.html#Adamowicz93 2003-11-28 Notions of symmetry n set theory with classes. 275-295 2000 106 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal106.html#Tzouvaras00 2003-11-28 Skew confluence and the lambda calculus with letrec. 95-168 2002 117 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal117.html#AriolaB02 2003-11-28 Linear Logic with Fixed Resources. 3-28 1994 67 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal67.html#ArchangelskyT94 2003-11-28 Constructive Compact Operators on a Hilbert Space. 31-37 1991 52 Ann. Pure Appl. Logic 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal52.html#Ishihara91 2006-02-07 Relating word and tree automata. 126-146 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#KupfermanSV06 2006-02-07 On self-embeddings of computable linear orderings. 52-76 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#DowneyJM06 2006-05-17 The existence of high nonbounding degrees in the difference hierarchy. 31-51 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#ChongLY06 2006-02-07 Complexity of monodic guarded fragments over linear and real time. 94-125 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#Hodkinson06 2006-02-07 Final coalgebras and the Hennessy-Milner property. 77-93 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#Goldblatt06 2006-02-07 On partial randomness. 20-30 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#CaludeST06 2006-02-07 What can be efficiently reduced to the Kolmogorov-random strings? 2-19 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#AllenderBK06 2006-02-07 Parameterized counting problems. 147-182 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#McCartin06 2006-02-07 Foreword. 1- 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#DowneyG06 2006-02-07 Kolmogorov-Loveland randomness and stochasticity. 183-210 2006 138 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal138.html#MerkleMNRS06 2006-02-07 Complemented sublocales and open maps. 240-255 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.030 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Johnstone06 2006-02-07 Compactness in locales and in formal topology. 413-438 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.028 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Vickers06 2006-02-07 Heyting-valued interpretations for Constructive Set Theory. 164-188 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.021 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Gambino06 2006-02-07 Regular universes and formal spaces. 299-316 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.025 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Palmgren06a 2006-02-07 Maximal and partial points in formal spaces. 291-298 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.024 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Palmgren06 2006-02-07 A globalisation of the Gelfand duality theorem. 62-103 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.018 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#BanaschewskiM06 2006-02-07 Aspects of general topology in constructive set theory. 3-29 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.016 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Aczel06 2006-02-07 Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert. 256-290 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.023 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Lombardi06 2006-02-07 Pretopologies and a uniform presentation of sup-lattices, quantales and frames. 30-61 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.017 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#BattilottiS06 2006-02-07 Completions, comonoids, and topological spaces. 104-125 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.029 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#BucaloR06 2006-02-07 Constructive algebraic integration theory. 380-390 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.031 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Spitters06 2006-02-07 Finite approximation of measure and integration. 439-449 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.033 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Webster06 2006-02-07 Programming interfaces and basic topology. 189-239 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.022 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#HancockH06 2006-02-07 Compactly generated Hausdorff locales. 147-163 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.020 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Escardo06 2006-02-07 On the parallel between the suplattice and preframe approaches to locale theory. 391-412 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.027 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Townsend06 2006-02-07 Preface. 1-2 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.015 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#BanaschewskiCS06 2006-02-07 The constructive maximal point space and partial metrizability. 360-379 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.032 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Smyth06 2006-02-07 On the collection of points of a formal space. 126-146 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.019 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Curi06 2006-02-07 Formal Zariski topology: Positivity and points. 317-359 2006 137 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.05.026 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal137.html#Schuster06 2006-02-07 Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory. 156-174 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Rathjen05 2006-02-07 Completing pseudojump operators. 297-333 2005 136 Ann. Pure Appl. Logic 3 http://dx.doi.org/10.1016/j.apal.2003.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#ColesDJL05 2006-02-07 Preface. 1-2 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#BeckmannAM05 2006-02-07 Reflections on reflections in explicit mathematics. 116-133 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#JagerS05 2006-02-07 Inductive definitions over a predicative arithmetic. 175-188 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#WainerW05 2006-02-07 A term calculus for (co-)recursive definitions on streamlike data structures. 75-90 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Buchholz05 2006-02-07 <i>II</i>₁⁰-FIX. 3-21 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Arai05 2006-02-07 Remarks on applicative theories. 91-115 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Cantini05 2006-02-07 <i>k</i>-bounded exponential-logarithmic power series fields. 284-296 2005 136 Ann. Pure Appl. Logic 3 http://dx.doi.org/10.1016/j.apal.2005.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#KuhlmannS05 2006-02-07 Structures interpretable in models of bounded arithmetic. 247-266 2005 136 Ann. Pure Appl. Logic 3 http://dx.doi.org/10.1016/j.apal.2005.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Thapen05 2006-02-07 Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results. 189-218 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Weiermann05 2006-02-07 _n⁰-consequences of theories. 56-74 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#BeklemishevV05 2006-02-07 Controlling witnesses. 22-29 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Baaz05 2006-02-07 Separation results for the size of constant-depth propositional proofs. 30-55 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#BeckmannB05 2006-02-07 A simple proof of second-order strong normalization with permutative conversions. 134-155 2005 136 Ann. Pure Appl. Logic 1-2 http://dx.doi.org/10.1016/j.apal.2005.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#TatsutaM05 2006-02-07 First-order definitions of rational functions and s-integers over holomorphy rings of algebraic functions of characteristic 0. 267-283 2005 136 Ann. Pure Appl. Logic 3 http://dx.doi.org/10.1016/j.apal.2005.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#Shlapentokh05 2006-02-07 Enumerations in computable structure theory. 219-246 2005 136 Ann. Pure Appl. Logic 3 http://dx.doi.org/10.1016/j.apal.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal136.html#GoncharovHKMMS05 2006-02-07 The elementary theory of Dedekind cuts in polynomially bounded structures. 113-134 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Tressl05 2006-02-07 Bounded functional interpretation. 73-112 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#FerreiraO05 2006-02-07 Tableaux for constructive concurrent dynamic logic. 1-72 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#WijesekeraN05 2006-02-07 Constructive completions of ordered sets, groups and fields. 243-262 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Palmgren05 2006-02-07 Alternating automata and temporal logic normal forms. 263-285 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#DixonBF05 2006-02-07 Upper and lower Ramsey bounds in bounded arithmetic. 135-150 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Ojakian05 2006-02-07 A generalization of von Neumann regularity. 210-242 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Sureson05 2006-02-07 Two simple sets that are not positively Borel. 151-209 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Veldman05 2006-02-07 Geometric axioms for existentially closed Hasse fields. 286-302 2005 135 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2005.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal135.html#Kowalski05 2006-02-07 Free abelian lattice-ordered groups. 265-283 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.10.017 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#GlassMP05 2006-02-07 Inductive types and exact completion. 95-121 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Berg05 2006-02-07 On sparseness, reducibilities, and complexity. 53-61 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Cucker05 2006-02-07 Polarized and focalized linear and classical proofs. 217-264 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#LaurentQF05 2006-02-07 WoLLIC'2002. 1-4 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.10.015 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#QueirozPA05 2006-02-07 Comparing and implementing calculi of explicit substitutions with eta-reduction. 5-41 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Ayala-RinconMK05 2006-02-07 Safe beliefs for propositional theories. 63-82 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#OsorioPA05 2006-02-07 Finite information logic. 83-93 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.013 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#ParikhV05 2006-02-07 Subgroups of the additive group of a separably closed field. 169-216 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.06.014 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Blossier05 2006-02-07 Linear realizability and full completeness for typed lambda-calculi. 122-168 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#AbramskyL05 2006-02-07 Undefinability results in o-minimal expansions of the real numbers. 43-51 2005 134 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Bianconi05 2006-02-08 <i>o</i>-minimal structures. 303-313 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2005.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#BerarducciOPP05 2006-02-07 Explicit mathematics: power types and overloading. 284-302 2005 134 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal134.html#Studer05 2006-02-07 Generic pairs of SU-rank 1 structures. 103-149 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Vassiliev03 2006-02-07 Superrigidity and countable Borel equivalence relations. 237-262 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Thomas03 2006-02-07 Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. 165-196 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Tupailo03 2006-02-07 The additive mutilboxes. 65-102 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Falco03 2006-02-07 Karp complexity and classes with the independence property. 263-283 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#LaskowskiS03 2006-02-07 Changing cofinalities and collapsing cardinals in models of set theory. 225-236 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Kurilic03 2006-02-07 Summable gaps. 1-63 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Hirschorn03 2006-02-07 Ordinal notations and well-orderings in bounded arithmetic. 197-223 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#BeckmannPB03 2006-02-07 The complexity of predicate default logic over a countable domain. 151-163 2003 120 Ann. Pure Appl. Logic 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal120.html#Milnikel03 2006-02-09 Non-strictly positive fixed points for classical natural deduction. 205-230 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#Matthes05 2006-02-09 Uniform Heyting arithmetic. 125-148 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#Berger05 2006-02-09 Zero, successor and equality in BDDs. 101-123 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#BadbanP05 2006-02-09 Preface. 1- 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#BuchholzK05 2006-02-09 Control structures in programs and computational complexity. 247-273 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#Niggl05 2006-02-09 Continuous normalization for the lambda-calculus and Gödel's. 39-71 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#AehligJ05 2006-02-09 Axioms for strict and lazy functional programs. 293-318 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#Stark05 2006-02-09 Automated search for Gödel's proofs. 319-338 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.014 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#SiegF05 2006-02-09 A game semantics for generic polymorphism. 3-37 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#AbramskyJ05 2006-02-09 About cut elimination for logics of common knowledge. 73-99 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#AlberucciJ05 2006-02-09 Algebraically complete semirings and Greibach normal form. 173-203 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#EsikL05 2006-02-09 <i>S</i>4 in (0, 1). 231-245 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#MintsZ05 2006-02-09 Elementary arithmetic. 275-292 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#OstrinW05 2006-02-09 Abstract State Machines: a unifying view of models of computation and of system design frameworks. 149-171 2005 133 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal133.html#Borger05 2006-02-09 Independence results around constructive ZF. 209-225 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Lubarsky05 2006-02-09 Some results on extensionality in lambda calculus. 109-125 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2003.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#IntrigilaS05 2006-02-09 Lattice-ordered reduced special groups. 27-49 2005 132 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#DickmannMM05 2006-02-09 Analytic Zariski structures and the Hrushovski construction. 127-180 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#PeatfieldZ05 2006-02-09 Weak elimination of imaginaries for Boolean algebras. 247-270 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Wencel05 2006-02-09 Completely mitotic c.e. degrees and non-jump inversion. 181-207 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Griffiths05 2006-02-09 Stability in geometric theories. 313-326 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.10.016 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Gagelman05 2006-02-09 The logic of proofs, semantically. 1-25 2005 132 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Fitting05 2006-02-09 A Banach-Mazur computable but not Markov computable function on the computable real numbers. 227-246 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Hertling05 2006-02-09 Equivalents of the (Weak) Fan Theorem. 51-66 2005 132 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Loeb05 2006-02-09 Forcing indestructibility of MAD families. 271-312 2005 132 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/j.apal.2004.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#BrendleY05 2006-02-09 Dependence relations in computably rigid computable vector spaces. 97-108 2005 132 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#DimitrovHM05 2006-02-09 Pseudo-exponentiation on algebraically closed fields of characteristic zero. 67-95 2005 132 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/j.apal.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal132.html#Zilber05 2006-02-09 Completeness of S4 with respect to the real line: revisited. 287-301 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#BezhanishviliG05 2006-02-09 Dynamic topological logic. 133-158 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#KremerM05 2006-02-09 Faith & falsity. 103-131 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#Visser05 2006-02-09 <i>n</i>-Simple theories. 227-261 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#Kolesnikov05 2006-02-09 Logical aspects of Cayley-graphs: the group case. 263-286 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#KuskeL05 2006-02-09 The minimal e-degree problem in fragments of Peano arithmetic. 159-175 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#ArslanovCCY05 2006-02-09 Coherent phase spaces. Semiclassical semantics. 177-225 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#Slavnov05 2006-02-09 A Sahlqvist theorem for distributive modal logic. 65-102 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#GehrkeNV05 2006-02-09 Softness of hypercoherences and MALL full completeness. 1-63 2005 131 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal131.html#BluteHS05 2006-02-09 The proof complexity of linear algebra. 277-323 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.018 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#SoltysC04 2006-02-09 Modal and guarded characterisation theorems over finite transition systems. 173-205 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Otto04 2006-02-09 <i>Y</i>calculus. 325-337 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Statman04 2006-06-21 Computational adequacy for recursive types in models of intuitionistic set theory. 207-275 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Simpson04 2006-02-09 Expressive equivalence of least and inflationary fixed-point logic. 61-78 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Kreutzer04 2006-02-09 An approach to deciding the observational equivalence of Algol-like languages. 125-171 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Ong04 2006-02-09 Foreword. 1- 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Plotkin04 2006-02-09 The complexity of first-order and monadic second-order logic revisited. 3-31 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#FrickG04 2006-02-09 Deciding confluence of certain term rewriting systems in polynomial time. 33-59 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#GodoyTV04 2006-02-09 Polarized games. 79-123 2004 130 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal130.html#Laurent04 2006-02-09 The Kolmogorov complexity of random reals. 163-180 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#YuDD04 2006-02-09 The theory of modules of separably closed fields 2. 181-210 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#DellundeDP04 2006-02-09 Dual weak pigeonhole principle, Boolean complexity, and derandomization. 1-37 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#Jerabek04 2006-02-09 The combinatorics of splittability. 107-130 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#Tsaban04 2006-02-09 Internality and interpretable automorphism groups in simple theories. 149-162 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#Shami04 2006-02-09 Saturated models of intuitionistic theories. 245-275 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#Butz04 2006-02-09 Canonical structure in the universe of set theory: part one. 211-243 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#CummingsFM04 2006-02-09 An existential locality theorem. 131-148 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#GroheW04 2006-02-09 Krivine's intuitionistic proof of classical completeness (for countable languages). 93-106 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#BerardiV04 2006-02-09 ₃-reflection. 39-92 2004 129 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal129.html#Arai04 2006-02-20 First-order theories of subgroups of divisible Hahn products. 261-279 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00115-X http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Lucas03 2006-02-20 <i>L</i>₁-approximation. 1-38 2003 121 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/S0168-0072(02)00081-7 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#KohlenbachO03 2006-02-20 <i>ID</i>₁₁⁰₁⁰). 163-208 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00112-4 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Arai03 2006-02-20 Erratum to "Zero-one laws for modal logic" [Ann. Pure Appl. Logic 69 (1994) 157-193]. 281-283 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00111-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#HalpernK03 2006-02-20 Analytic colorings. 145-161 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00110-0 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#KubisS03 2006-02-20 <i>P</i>_kappa(lambda). 89-111 2003 121 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/S0168-0072(02)00083-0 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Matet03 2006-02-20 Turing degrees of hypersimple relations on computable structures. 209-226 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00113-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Harizanov03 2006-02-20 Coset-minimal groups. 113-143 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00084-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#BelegradekVW03 2006-02-20 Erratum to "Saturated models of universal theories": [Ann. Pure Appl. Logic 118 (2002) 219-234]. 285- 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(03)00004-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Avigad03 2006-02-20 On the expressiveness of choice quantification. 39-87 2003 121 Ann. Pure Appl. Logic 1 http://dx.doi.org/10.1016/S0168-0072(02)00082-9 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Luttik03 2006-02-20 Simple generic structures. 227-260 2003 121 Ann. Pure Appl. Logic 2-3 http://dx.doi.org/10.1016/S0168-0072(02)00114-8 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal121.html#Pourmahdian03 2006-02-20 On nonelementarily equivalent pairs of fields. 289-291 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(02)00116-1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Khelif03 2006-02-20 G-dinaturality. 131-173 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00003-4 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Petric03 2006-02-20 Proof theory for theories of ordinals - I: recursively Mahlo ordinals. 1-85 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00020-4 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Arai03a 2006-02-20 On non-abelian C-minimal groups. 263-287 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00019-8 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Simonetta03 2006-02-20 ₁¹transfinite dependent choice. 195-234 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00006-X http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Ruede03 2006-02-20 System ST toward a type system for extraction and proofs of programs. 107-130 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00002-2 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Raffalli03 2006-02-20 True cofinality and bounding number for small products of partial orders. 87-106 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(02)00041-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Neumann03 2006-02-20 Lovely pairs of models. 235-261 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00018-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#Ben-YaacovPV03 2006-02-20 CM-triviality and relational structures. 175-194 2003 122 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00005-8 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal122.html#VerbovskiyY03 2006-02-20 Introduction to computability logic. 1-99 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00023-X http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#Japaridze03 2006-02-20 Observational ultraproducts of polynomial coalgebras. 235-290 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00038-1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#Goldblatt03 2006-02-20 A proof-theoretic investigation of a logic of positions. 135-162 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00021-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#BaratellaM03 2006-02-20 Almost free groups and long Ehrenfeucht-Fraïssé games. 101-134 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(02)00063-5 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#Vaisanen03 2006-02-20 Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. 291- 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00039-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#BeckmannBP03 2006-02-20 Homomorphisms and quotients of degree structures. 193-233 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00024-1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#EnglertLW03 2006-02-20 Equivalence between Wadge and Lipschitz determinacy. 163-192 2003 123 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00022-8 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal123.html#Andretta03 2006-02-20 A second-order system for polytime reasoning based on Grädel's theorem. 193-231 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00056-3 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#CookK03 2006-02-20 A blend of methods of recursion theory and topology. 141-178 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00054-X http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#KalantariW03 2006-02-20 SH plus CH does not imply stationary antichains. 233-265 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00057-5 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#Schlindwein03 2006-02-20 Independence of Boolean algebras and forcing. 179-191 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00055-1 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#Kurilic03a 2006-02-20 Induction-recursion and initial algebras. 1-47 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(02)00096-9 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#DybjerS03 2006-02-20 Inductively generated formal topologies. 71-106 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00052-6 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#CoquandSSV03 2006-02-20 Repairing the interpolation theorem in quantified modal logic. 287-299 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00059-9 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#ArecesBM03 2006-02-20 Local coherence. 107-139 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00053-8 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#Konig03 2006-02-20 Intuitionistic axiomatizations for bounded extension Kripke models. 267-285 2003 124 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00058-7 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal124.html#ArdeshirRS03 2006-02-20 More canonical forms and dense free subsets. 75-99 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#Mildenberger04 2006-02-20 Constructing omega-stable structures: model completeness. 159-172 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#BaldwinH04 2006-02-20 An effective version of Wilkie's theorem of the complement and some effective o-minimality results. 43-74 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#BerarducciS04 2006-02-20 More existence theorems for recursion categories. 1-41 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/S0168-0072(03)00060-5 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#Lengyel04 2006-02-20 ^*-maximality. 119-158 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#DzamonjaS04 2006-02-20 Complementing cappable degrees in the difference hierarchy. 101-118 2004 125 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal125.html#DowneyLW04 2006-02-20 Preservation theorems and restricted consistency statements in bounded arithmetic. 255-280 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Beckmann04 2006-02-20 Reexamination of Tarski's semantics. 39-48 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Hiz04 2006-02-20 What is the world of mathematics? 149-158 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.014 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Lambek04 2006-02-20 Algorithmic uses of the Feferman-Vaught Theorem. 159-213 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Makowsky04 2006-02-20 Decidability without mathematics. 309-312 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.029 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Grzegorczyk04 2006-02-20 The spectrum of maximal independent subsets of a Boolean algebra. 335-348 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.028 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Monk04 2006-02-20 Truth and definite truth. 49-55 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#HyttinenS04 2006-02-21 <i>L</i>_infinitf<i>c</i>₀. 301-308 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.023 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Grzech04 2006-02-20 Undefinability of truth and nonstandard models. 115-123 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Kossak04 2006-02-20 Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. 77-92 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Addison04 2006-02-20 Computational inductive definability. 139-148 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Kozen04 2006-02-20 On hereditarily indecomposable Banach spaces. 293-299 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#FigielFKR04 2006-02-20 On Tarski's contribution to the additive measure theory and its consequences. 281-286 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#BenvenutiM04 2006-02-20 What languages have Tarski truth definitions? 93-113 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Hodges04 2006-02-20 The indefinability of truth in the "Wahrheitsbegriff". 27-37 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Gomez-Torrente04 2006-02-20 The incompleteness theorems after 70 years. 125-138 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Kotlarski04 2006-02-20 On the tension between Tarski's nominalism and his model theory (definitions for a mathematical model of knowledge). 215-224 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.021 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Mycielski04 2006-02-20 Free Boolean algebras and nowhere dense ultrafilters. 287-292 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.022 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Blaszczyk04 2006-02-20 Editorial. 3-4 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#AdamowiczANORW04 2006-02-20 Preface. 1-2 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.015 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Nerode04 2006-02-20 Tarski's conception of logic. 5-13 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.016 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Feferman04 2006-02-20 Independence-friendly logic and axiomatic set theory. 313-333 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Hintikka04 2006-02-20 Applying, extending, and specializing pseudorecursiveness. 225-254 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.027 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Wells04 2006-02-20 Tarski's definition and truth-makers. 57-76 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Niiniluoto04 2006-02-20 Tarski, truth and natural languages. 15-26 2004 126 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.10.017 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal126.html#Fenstad04 2006-02-20 Foundations for the formalization of metamathematics and axiomatizations of consequence theories. 243-266 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.018 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Wybraniec-Skardowska04 2006-02-20 <i>fgf</i><i>f</i><i>gfg</i><i>g</i>. 229-242 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.017 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Surma04 2006-02-20 Philosophical reflection on mathematics in Poland in the interwar period. 325-337 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.026 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Murawski04 2006-02-20 Ternary relations and relevant semantics. 195-217 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.015 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Meyer04 2006-02-20 Minimum bases for equational theories of groups and rings: the work of Alfred Tarski and Thomas Green. 131-153 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#McNulty04 2006-02-20 On the Warsaw interactions of logic and mathematics in the years 1919-1939. 289-301 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.025 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Duda04 2006-02-20 Gödel on Tarski. 303-323 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.019 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Krajewski04 2006-02-20 First-order intensional logic. 171-193 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Fitting04 2006-02-20 Computational complexity of the semantics of some natural language constructions. 219-227 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.016 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#MostowskiW04 2006-02-20 Lesniewski's early Liar, Tarski and natural language. 267-287 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.024 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Betti04 2006-02-20 Boolean algebras arising from information systems. 77-98 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#DuntschO04 2006-02-20 Dynamic extensions of arrow logic. 1-15 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#BalbianiV04 2006-02-20 <i>Aletheia</i>in Greek thought until Aristotle. 339-360 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.020 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Wolenski04 2006-02-20 Unification, finite duality and projectivity in varieties of Heyting algebras. 99-115 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Ghilardi04 2006-02-20 Fregean logics. 17-76 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#CzelakowskiP04 2006-02-20 Finite, integral, and finite-dimensional relation algebras: a brief history. 117-130 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Maddux04 2006-02-20 Intuitionistic logic and modality via topology. 155-170 2004 127 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal127.html#Esakia04 2006-02-20 Effective completeness theorems for modal logic. 141-195 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#GanguliN04 2006-02-20 Supercomplete extenders and type 1 mice: Part I. 1-73 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#FengJ04 2006-02-20 Concept lattices and order in fuzzy logic. 277-298 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#Belohlavek04 2006-02-20 Provability algebras and proof-theoretic ordinals, I. 103-123 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.030 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#Beklemishev04 2006-02-20 Simple stable homogeneous expansions of Hilbert spaces. 75-101 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.033 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#BerensteinB04 2006-02-20 The guarded fragment with transitive guards. 227-276 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#SzwastT04 2006-02-20 <i>MV</i>-algebras. 125-139 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.031 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#NolaG04 2006-02-20 An intensional fixed point theory over first order arithmetic. 197-213 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2003.11.032 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#Jager04 2006-02-20 Shrinking games and local formulas. 215-225 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#KeislerL04 2006-02-20 Erratum to "Applying, extending, and specializing pseudorecursiveness": [Ann. Pure Appl. Logic 126 (2004) 225-254]. 299- 2004 128 Ann. Pure Appl. Logic 1-3 http://dx.doi.org/10.1016/j.apal.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/apal/apal128.html#Wells04a 2003-12-02 Evolving Neuro-Controllers for a Dynamic System Using Structured Genetic Algorithms. 113-121 1998 8 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Dasgupta98 2003-12-02 Space, Time, and Computation: Trends and Problems. 5-9 1996 6 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#AngerRGB96 2003-12-02 Interactive Case-Based Reasoning in Sequential Diagnosis. 65-76 2001 14 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#McSherry01 2003-12-02 Knowledge Integration in a Multiple Classifier System. 75-86 1996 6 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#Lu96 2003-12-02 An Efficient Database Transitive Closure Algorithm. 205-218 1994 4 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin4.html#TorosluQH94 2003-12-02 Formalizing Calendars with the Category of Ordinals. 275-295 2002 17 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#Schwer02 2003-12-02 Qualitative Geometry for Shape Recognition. 253-263 2002 17 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#DugatGL02 2003-12-02 Problem Solving with a Perpetual Evolutionary Learning Architecture. 53-71 1998 8 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Chen98 2003-12-02 Evolutionary Learning of Modular Neural Networks with Genetic Programming. 191-200 1998 9 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#ChoS98 2003-12-02 Applying Learning by Examples for Digital Design Automation. 205-221 2002 16 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#Choi02 2003-12-02 Knowledge Extraction from Transducer Neural Networks. 27-42 2000 12 Appl. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#Wermter00 2003-12-02 Developing Mobile Robot Wall-Following Algorithms Using Genetic Programming. 33-41 1998 8 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Dain98 2003-12-02 Managing Tasks Using an Interval-Based Temporal Logic. 311-323 1996 6 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#DasH96 2003-12-02 Influence of the Migration Policy in Parallel Distributed GAs with Structured and Panmictic Populations. 163-181 2000 12 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#AlbaT00 2003-12-03 A New Symmetric Probabilistic Encryption Scheme Based on Chaotic Attractors of Neural Networks. 71-84 1999 10 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#GuoCC99 2003-12-02 Towards a Knowledge-Level Model of Context and Context Use in Diagnostic Problems. 123-137 1999 10 Appl. Intell. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#Ozturk99 2003-12-02 Hierarchical Integration of Sensor Data and Contextual Information for Automatic Target Recognition. 269-290 1995 5 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#DrakeK95 2003-12-02 Identifying Approximate Itemsets of Interest in Large Databases. 91-104 2003 18 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#ZhangZW03 2003-12-02 Neural Networks Approach to the Random Walk Dilemma of Financial Time Series. 163-171 2002 16 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#SitteS02 2003-12-02 Design of an Autonomous Agricultural Robot. 41-50 1995 5 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#Edan95 2003-12-02 Modelling a Society of Simple Agents: From Conceptual Specification to Experimentation. 161-178 2001 14 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#BrazierET01 2003-12-02 Characteristic Rule Discovery in Aurum-3. 297-304 1999 11 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#McSherryR99 2003-12-02 Explanation Over Inference Hierarchies in Active Mediation Applications. 101-112 2000 13 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#MinockC00 2003-12-02 An Architecture for Planning in Embedded Systems. 157-172 1998 8 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Spalazzi98 2003-12-02 Variable Hidden Layer Sizing in Elman Recurrent Neuro-Evolution. 193-205 2000 12 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#KaikhahG00 2003-12-02 Computer Generated Holograms for Optical Neural Networks. 145-160 2001 14 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#KaikhahL01 2003-12-02 Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes. 187-204 2000 13 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#HerreraL00 2003-12-02 SCHEMA: A Knowledge Edition Interface for Obtaining Program Code from Structured Descriptions of PSMs: Two Case Studies. 139-153 1999 10 Appl. Intell. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#HerreroM99 2003-12-02 State Space Search with Prioritised Soft Constraints. 263-272 2001 14 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#AlechinaL01 2003-12-02 Towards Creative Evolutionary Systems with Interactive Genetic Algorithm. 129-138 2002 16 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#Cho02 2003-12-02 Introduction: Conceptual Models for Intelligent Information Systems. 99 2000 13 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#Chu00 2003-12-02 Formal Reasoning in Intelligent Database Systems. 297-317 1995 5 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#Lee95 2003-12-02 Data Mining and Machine Oriented Modeling: A Granular Computing Approach. 113-124 2000 13 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#Lin00 2003-12-02 Formal Verification of Some Potential Contradictions in Knowledge Base Using a High Level Net Approach. 325-343 1996 6 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#Liu96 2003-12-02 Progress in Intelligent Data Analysis. 235-240 1999 11 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#Liu99 2005-01-03 A Mixture of Experts Network Structure Construction Algorithm for Modelling and Control. 59-69 2002 16 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#HongH02 2003-12-02 Effective Query Size Estimation Using Neural Networks. 173-183 2002 16 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#LuS02 2003-12-02 Introduction. 5-6 1998 9 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#Imam98 2003-12-02 Evolutionary Approaches to Figure-Ground Separation. 187-212 1999 11 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#BhandarkarZ99 2003-12-02 Schemas, Logics, and Neural Assemblies. 83-102 1995 5 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#Sun95 2003-12-02 Unsupervised Extraction of Structural Information from High Dimensional Visual Data. 63-74 2000 12 Appl. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#McGlincheyCLF00 2003-12-02 Feature Competitive Algorithm for Dimension Reduction of the Self-Organizing Map Input Space. 215-230 2000 13 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#YeL00 2003-12-02 Massively Parallel Probabilistic Reasoning with Boltzmann Machines. 31-44 1999 11 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#Myllymaki99 2003-12-02 Dynamic Flexible Constraint Satisfaction. 231-245 2000 13 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#MiguelS00 2003-12-02 Analysis of 3D Hand Trajectory Gestures Using Stroke-Based Composite Hidden Markov Models. 131-143 2001 15 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin15.html#KimC01 2003-12-02 Algorithm Recognition for Programming Tutoring Based on Flow Graph Parsing. 153-164 1996 6 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#KimK96 2003-12-02 Efficient GA Based Techniques for Classification. 277-284 1999 11 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#SharpeG99 2003-12-02 Scalable Techniques from Nonparametric Statistics for Real Time Robot Learning. 49-60 2002 17 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#SchaalAV02 2005-10-12 Introduction. 219-220 2002 17 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#GuesgenALR02 2003-12-02 Special Issue on Decision Theory and Artificial Intelligence. 235-236 2001 14 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#Lang01 2003-12-02 Augmenting the Discrimination Power of HMM by NN for On-Line Cursive Script Recognition. 305-314 1997 7 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#LeeK97 2003-12-02 Supervised Extended ART: A Fast Neural Network Classifier Trained by Combining Supervised and Unsupervised Learning. 117-128 1996 6 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#LeeL96 2003-12-02 Recognition of Handwritten ZIP Codes in a Real-World Non-Standard-Letter Sorting System. 95-114 2000 12 Appl. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#PfisterBR00 2003-12-02 Incremental Feature Selection. 217-230 1998 9 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#LiuS98 2003-12-02 Using Disruptive Selection to Maintain Diversity in Genetic Algorithms. 257-267 1997 7 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#KuoH97 2003-12-02 Mining Fuzzy Multiple-Level Association Rules from Quantitative Data. 79-90 2003 18 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#HongLC03 2003-12-02 Generalized Radial Basis Function Networks Trained with Instance Based Learning for Data Mining of Symbolic Data. 223-234 2002 16 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#PapadimitriouMVB02 2003-12-02 Symbolical Reasoning about Numerical Data: A Hybrid Approach. 339-354 1997 7 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#Herrmann97 2003-12-02 Advances in SHRUTI-A Neurally Motivated Model of Relational Knowledge Representation and Rapid Inference Using Temporal Synchrony. 79-108 1999 11 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#Shastri99 2003-12-02 A Fuzzy Diagnostic Model and Its Application in Automotive Engineering Diagnosis. 231-243 1998 9 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#LuCH98 2003-12-02 Real-Time Dynamic Visual Tracking Using PSD Sensors and Extended Trapezoidal Motion Planning. 53-70 1999 10 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#NamO99 2005-12-01 Classifier Architectures for Single Chamber Arrhythmia Recognition. 215-224 1996 6 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#JabriT96 2003-12-02 Automated Phase Design and Timing Adjustment for Signal Phase Design. 41-55 2001 15 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin15.html#WangHP01 2003-12-02 A Variational Approach to Multi-Sensor Fusion of Images. 217-235 1995 5 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#PienG95 2003-12-02 Compact Unstructured Representations for Evolutionary Design. 139-155 2002 16 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#HamdaJLSS02 2003-12-02 Constraint Satisfaction with an Object-Oriented Knowledge Representation Language. 157-184 1994 4 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin4.html#Caseau94 2003-12-02 Image Processing Using RBF like Neural Networks: A ZISC-036 Based Fully Parallel Implementation Solving Real World and Real Complexity Industrial Problems. 195-213 2003 18 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#MadaniTT03 2003-12-02 Diagnosis of Active Systems by Automata-Based Reasoning Techniques. 217-237 2000 12 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#LampertiZP00 2003-12-02 Possibility Theory in Constraint Satisfaction Problems: Handling Priority, Preference and Uncertainty. 287-309 1996 6 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#DuboisFP96 2003-12-02 Learning Translation Templates from Bilingual Translation Examples. 57-76 2001 15 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin15.html#CicekliG01 2003-12-02 Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine. 105-111 2003 18 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#MerkleM03 2003-12-02 A Neural Network Diagnosis Approach for Analog Circuits. 169-186 1999 11 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#FanniGMM99 2005-05-10 The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network. 75-93 2000 12 Appl. Intell. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#DaveyAG00 2003-12-02 Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions. 285-300 2000 13 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#Ross00 2003-12-02 The Evolution of Concurrent Programs. 21-32 1998 8 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Ross98 2003-12-02 Searching a Scalable Approach to Cerebellar Based Control. 11-33 2002 17 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#PetersS02 2003-12-02 Temporal Contexts for Discourse Representation: An Extension of the Conceptual Graph Approach. 227-255 1997 7 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#Moulin97 2003-12-02 Neural-Fuzzy Models for Multispectral Image Analysis. 173-187 1998 8 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#Kulkarni98 2003-12-02 Automatic Extraction of Eye and Mouth Fields from a Face Image Using Eigenfeatures and Ensemble Networks. 171-185 2002 17 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#RyuO02 2003-12-02 Incorporating Ancestors' Influence in Genetic Algorithms. 7-25 2003 18 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#GhoshGP03 2003-12-02 Soft Computing Based Pattern Classifiers for the Obstacle Avoidance Behavior of Intelligent Autonomous Vehicles (IAV). 249-272 2002 16 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#AzouaouiC02 2003-12-02 A Fuzzy Approach to Accessing Accident Databases. 129-137 1998 9 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#ChungJ98 2003-12-02 Embedding Branch and Bound within Evolutionary Algorithms. 137-153 2003 18 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#CottaT03 2003-12-02 Printed Circuit Board Design via Organizational-Learning Agents. 25-37 1998 9 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#TakadamaNT98 2003-12-02 A Knowledge-Level Model for Concurrent Design. 113-122 1999 10 Appl. Intell. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#BarkerMT99 2003-12-02 An Efficient Gradient Forecasting Search Method Utilizing the Discrete Difference Equation Prediction Model. 43-58 2002 16 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#ChenL02 2003-12-02 A Computer Vision System for Extravehicular Activity Helper/Retriever. 251-268 1995 5 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#Chien95 2004-01-05 A Comparison of Experimental Results with an Evolution Strategy and Competitive Neural Networks for Near Real-Time Color Quantization of Image Sequences. 43-51 1998 8 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#GonzalezGDAT98 2003-12-02 Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning. 239-251 2002 17 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#BennettCWZ02 2003-12-02 An Interactive Case-Based Reasoning Approach for Generating Expressive Music. 115-129 2001 14 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#ArcosM01 2003-12-02 Debugging Hardware Designs Using a Value-Based Model. 71-92 2002 16 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#Wotawa02 2003-12-02 Agent-Based Design Model of Adaptive Distributed Systems. 57-70 1998 9 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin9.html#FujitaHSKS98 2003-12-02 A Knowledge-Based Mesh Generation System for Forging Simulation. 149-168 1999 11 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#TakataNHYAW99 2003-12-02 Introduction to Financial Forecasting. 205-213 1996 6 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#Abu-MostafaA96 2003-12-02 Behavioral Interpretation According to Multimodeling Representation. 213-226 1999 10 Appl. Intell. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#ZouaouiTD99 2003-12-02 Spatial Persistence. 11-28 1996 6 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#GuesgenH96 2003-12-02 GEAMAS: A Generic Architecture for Agent-Oriented Simulations of Complex Processes. 247-267 1998 8 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#MarcenacG98 2003-12-02 Counter-Propagation Neural Networks for Molecular Sequence Classification: Supervised LVQ and Dynamic Node Allocation. 27-38 1997 7 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#WuCC97 2003-12-02 SYMCON - A Hybrid Symbolic/Connectionist System for Word Sense Disambiguation. 5-26 1997 7 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#WuMO97 2003-12-02 An Intelligent System Combining Different Resource-Bounded Reasoning Techniques. 127-140 2002 17 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#MouaddibGD02 2004-02-12 The Connectionist Inductive Learning and Logic Programming System. 59-77 1999 11 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#GarcezZ99 2003-12-02 Evolutionary Design Systems and Generative Processes. 119-128 2002 16 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin16.html#JanssenFT02 2003-12-02 Simulated Evolution and Learning: An Introduction. 151-152 2001 15 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin15.html#YaoM01 2003-12-02 Introduction: Evolutionary Learning. 5 1998 8 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#YaoP98 2003-12-02 An Agent-Based Approach for Scheduling Multiple Machines. 135-144 2001 14 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#AkkirajuKMW01 2003-12-02 Neural Navigation Approach for Intelligent Autonomous Vehicles (IAV) in Partially Structured Environments. 219-233 1998 8 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#ChohraFB98 2003-12-02 QUBICS: A General Quantity Base Management System. 367-380 1995 5 Appl. Intell. 4 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin5.html#Yoon95 2003-12-02 MDS: An Integrated Architecture for Associational and Model-Based Diagnosis. 179-195 2001 14 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#YuBW01 2005-10-13 Predicting Aflatoxin Contamination in Peanuts: A Genetic Algorithm/Neural Network Approach. 183-192 2000 12 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin12.html#HendersonPMH00 2003-12-02 Change Detection in Overhead Imagery Using Neural Networks. 215-234 2003 18 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin18.html#Clifton03 2003-12-02 Signature Verification by Neural Networks with Selective Attention. 213-223 1999 11 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#XiaoL99 2003-12-02 Imputation of Missing Data in Industrial Databases. 259-275 1999 11 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin11.html#LakshminarayanHS99 2003-12-02 The Hypercube Separation Algorithm: A Fast and Efficient Algorithm for On-Line Handwritten Character Recognition. 101-116 1996 6 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#UlgenAI96 2003-12-02 On-Line Shape Recognition with Incremental Training Using Binary Synaptic Weights Algorithm. 225-240 1996 6 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#UlgenFA96 2003-12-02 Interactive Case-Based Planning for Forest Fire Management. 41-57 2000 13 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#AvesaniPR00 2003-12-02 Context Knowledge Representation and Reasoning in the Context Interchange System. 165-180 2000 13 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#BressanGLMSS00 2003-12-02 An Intelligent Man-Machine Dialogue System Based on AI Planning. 235-245 1998 8 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin8.html#KuijpersD98 2003-12-02 Experimenting with a Temporal Constraint Propagation Algorithm. 39-48 1996 6 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#MitraL96 2003-12-02 Guest Editorial for Special Issue on Scalable Applications of Neural Networks to Robotics. 7-10 2002 17 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin17.html#SmagtB02 2003-12-02 An Advanced Case-Knowledge Architecture Based on Fuzzy Objects. 187-204 1997 7 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#DubitzkySHB97 2003-12-10 Comparative Performance of Rule Quality Measures in an Induction System. 113-124 1997 7 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin7.html#DeanF97 2003-12-02 Index Navigator: Search Engine with Reasoning for Understanding and Expressing User's Changing Mind. 197-211 2001 14 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#Ohsawa01 2003-12-02 A Symbolic Approach To Uncertainty Management. 265-283 2000 13 Appl. Intell. 3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin13.html#ChachouaP00 2003-12-02 On the Interpretation of Fuzzy If Then Rules. 141-151 1996 6 Appl. Intell. 2 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin6.html#Yager96 2003-12-02 Qualitative Event-Based Expert Supervision for Transient Condition Monitoring. 197-211 1999 10 Appl. Intell. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin10.html#NevesA99 2003-12-02 Enhancing the Effectiveness of Interactive Case-Based Reasoning with Clustering and Decision Forests. 49-64 2001 14 Appl. Intell. 1 http://www.informatik.uni-trier.de/~ley/db/journals/apin/apin14.html#YangW01