| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A clausal resolution method for branching-time logic ECTL+
|
Bolotov, Alexander
|
|
2006
|
|
3 |
p. 235-263
|
artikel
|
| 2 |
Adaptation of declaratively represented methods in proof planning
|
Xiaorong Huang
|
|
1998
|
|
3 |
p. 299-320
22 p.
|
artikel
|
| 3 |
A formal framework for evaluating heuristic programs
|
Lenore Cowen
|
|
1998
|
|
3 |
p. 193-206
14 p.
|
artikel
|
| 4 |
A mathematical framework for the semantics of symbolic languages representing periodic time
|
Egidi, Lavinia
|
|
2006
|
|
3 |
p. 317-347
|
artikel
|
| 5 |
An algebraic framework for temporal attribute characteristics
|
Böhlen, Michael
|
|
2006
|
|
3 |
p. 349-374
|
artikel
|
| 6 |
Analytic center cutting plane method for multiple kernel learning
|
Wulff, Sharon
|
|
2013
|
|
3 |
p. 225-241
|
artikel
|
| 7 |
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
|
Gennady Davydov
|
|
1998
|
|
3 |
p. 229-245
17 p.
|
artikel
|
| 8 |
An empirical study of the 4valued KripkeKleene and 4valued wellfounded semantics in random propositional logic programs
|
Chris Giannella
|
|
1999
|
|
3 |
p. 275-309
35 p.
|
artikel
|
| 9 |
Annals of Mathematics and Artificial Intelligence
|
|
|
2002
|
|
3 |
p. 319-322
4 p.
|
artikel
|
| 10 |
Annals of Mathematics and Artificial Intelligence
|
|
|
2003
|
|
3 |
p. 327-330
4 p.
|
artikel
|
| 11 |
An Overview of Backtrack Search Satisfiability Algorithms
|
Inês Lynce
|
|
2003
|
|
3 |
p. 307-326
20 p.
|
artikel
|
| 12 |
Anytime clausal reasoning
|
Mukesh Dalal
|
|
1998
|
|
3 |
p. 297-318
22 p.
|
artikel
|
| 13 |
A perspective on symbolic mathematical computing and artificial intelligence
|
J. Calmet
|
|
1997
|
|
3 |
p. 261-277
17 p.
|
artikel
|
| 14 |
Approximation Algorithms for the Class Cover Problem
|
Adam H. Cannon
|
|
2004
|
|
3 |
p. 215-223
9 p.
|
artikel
|
| 15 |
A review of the relations between logical argumentation and reasoning with maximal consistency
|
Arieli, Ofer
|
|
|
|
3 |
p. 187-226
|
artikel
|
| 16 |
A Theory of Frame Transformations for Belief Combination
|
Sergio A. Alvarez
|
|
2004
|
|
3 |
p. 187-213
27 p.
|
artikel
|
| 17 |
Auction design with costly preference elicitation
|
Parkes, David C.
|
|
2005
|
|
3 |
p. 269-302
|
artikel
|
| 18 |
Automating the synthesis of decision procedures in a constructive metatheory
|
Alessandro Armando
|
|
1998
|
|
3 |
p. 259-279
21 p.
|
artikel
|
| 19 |
Bargaining with incomplete information
|
Fatima, Shaheen S.
|
|
2005
|
|
3 |
p. 207-232
|
artikel
|
| 20 |
Boosting complete techniques thanks to local search methods
|
Bertrand Mazure
|
|
1998
|
|
3 |
p. 319-331
13 p.
|
artikel
|
| 21 |
Building a knowledge base an example
|
Michael Gelfond
|
|
1999
|
|
3 |
p. 165-199
35 p.
|
artikel
|
| 22 |
Composite Distributive Lattices as Annotation Domains for Mediators
|
Jacques Calmet
|
|
2002
|
|
3 |
p. 263-277
15 p.
|
artikel
|
| 23 |
Computing extended abduction through transaction programs
|
Katsumi Inoue
|
|
1999
|
|
3 |
p. 339-367
29 p.
|
artikel
|
| 24 |
Cooperative exploration and protection of a workspace assisted by information networks
|
Kim, Jonghoek
|
|
2013
|
|
3 |
p. 203-220
|
artikel
|
| 25 |
Disjoint essential sets of implicates of a CQ Horn function
|
Čepek, Ondřej
|
|
2011
|
|
3 |
p. 231-244
|
artikel
|
| 26 |
Domain adaptation–can quantity compensate for quality?
|
Ben-David, Shai
|
|
2013
|
|
3 |
p. 185-202
|
artikel
|
| 27 |
Editorial
|
Jürgen Dix
|
|
1999
|
|
3 |
p. 161-164
4 p.
|
artikel
|
| 28 |
Fast algebraic methods for interval constraint problems
|
Peter B. Ladkin
|
|
1997
|
|
3 |
p. 383-411
29 p.
|
artikel
|
| 29 |
Finding Essential Attributes from Binary Data
|
Endre Boros
|
|
2003
|
|
3 |
p. 223-257
35 p.
|
artikel
|
| 30 |
Foreword
|
|
|
2002
|
|
3 |
p. 237-237
1 p.
|
artikel
|
| 31 |
Foreword
|
|
|
2003
|
|
3 |
p. 209-210
2 p.
|
artikel
|
| 32 |
Formal Proofs About Rewriting Using ACL2
|
José-Luis Ruiz-Reina
|
|
2002
|
|
3 |
p. 239-262
24 p.
|
artikel
|
| 33 |
From logic programming towards multiagent systems
|
Robert Kowalski
|
|
1999
|
|
3 |
p. 391-419
29 p.
|
artikel
|
| 34 |
Generalized modus Ponens using various implications and T-norm product with threshold
|
Iancu, Ion
|
|
2013
|
|
3 |
p. 293-311
|
artikel
|
| 35 |
Global solutions for nonlinear systems using qualitative reasoning
|
E. Bradley
|
|
1998
|
|
3 |
p. 211-228
18 p.
|
artikel
|
| 36 |
Group planning with time constraints
|
Hadad, Meirav
|
|
2013
|
|
3 |
p. 243-291
|
artikel
|
| 37 |
Guest editorial: Temporal representation and reasoning
|
Bouzid, Maroua
|
|
2006
|
|
3 |
p. 231-234
|
artikel
|
| 38 |
Heuristic search and pruning in polynomial constraints satisfaction
|
Hoon Hong
|
|
1997
|
|
3 |
p. 319-334
16 p.
|
artikel
|
| 39 |
Heuristics used by HERBY for semantic tree theorem proving
|
Qingxun Yu
|
|
1998
|
|
3 |
p. 247-266
20 p.
|
artikel
|
| 40 |
Horn minimization by iterative decomposition
|
Endre Boros
|
|
1998
|
|
3 |
p. 321-343
23 p.
|
artikel
|
| 41 |
How Many Queries Are Needed to Learn One Bit of Information?
|
Hans-Ulrich Simon
|
|
2003
|
|
3 |
p. 333-343
11 p.
|
artikel
|
| 42 |
Identifying Terminal Distinguishable Languages
|
H. Fernau
|
|
2004
|
|
3 |
p. 263-281
19 p.
|
artikel
|
| 43 |
Impossibility results for belief contraction
|
Hansson, Sven Ove
|
|
|
|
3 |
p. 227-232
|
artikel
|
| 44 |
Inference guiding in propositional knowledge bases
|
Jinchang Wang
|
|
1998
|
|
3 |
p. 345-356
12 p.
|
artikel
|
| 45 |
Introducing the mathematical category of artificial perceptions
|
Z. ArziGonczarowski
|
|
1998
|
|
3 |
p. 267-298
32 p.
|
artikel
|
| 46 |
Introduction to the special issue on belief revision, argumentation, ontologies, and norms
|
Fermé, Eduardo
|
|
|
|
3 |
p. 185-186
|
artikel
|
| 47 |
Iterative Dutch combinatorial auctions
|
Biswas, Shantanu
|
|
2005
|
|
3 |
p. 185-205
|
artikel
|
| 48 |
Jeffrey’s rule of conditioning in a possibilistic framework
|
Benferhat, Salem
|
|
2011
|
|
3 |
p. 185-202
|
artikel
|
| 49 |
Locally Determined Logic Programs and Recursive Stable Models
|
Douglas Cenzer
|
|
2004
|
|
3 |
p. 225-262
38 p.
|
artikel
|
| 50 |
Logic knowledge bases with two default rules
|
Carolina Ruiz
|
|
1998
|
|
3 |
p. 333-361
29 p.
|
artikel
|
| 51 |
Logic programs with stable model semantics as a constraint programming paradigm
|
Ilkka Niemelä
|
|
1999
|
|
3 |
p. 241-273
33 p.
|
artikel
|
| 52 |
Modelbased and qualitative reasoning An introduction
|
Peter Struss
|
|
1997
|
|
3 |
p. 355-381
27 p.
|
artikel
|
| 53 |
Modeling Connectionist Network Structures: Some Geometric and Categorical Aspects
|
Jochen Pfalzgraf
|
|
2002
|
|
3 |
p. 279-301
23 p.
|
artikel
|
| 54 |
Most Relevant Explanation: computational complexity and approximation methods
|
Yuan, Changhe
|
|
2011
|
|
3 |
p. 159-183
|
artikel
|
| 55 |
Multi-armed bandits with episode context
|
Rosin, Christopher D.
|
|
2011
|
|
3 |
p. 203-230
|
artikel
|
| 56 |
Multiple-Instance Learning of Real-Valued Geometric Patterns
|
Sally A. Goldman
|
|
2003
|
|
3 |
p. 259-290
32 p.
|
artikel
|
| 57 |
Nested expressions in logic programs
|
Vladimir Lifschitz
|
|
1999
|
|
3 |
p. 369-389
21 p.
|
artikel
|
| 58 |
Nonmonotonic reasoning from complexity to algorithms
|
C. Cayrol
|
|
1998
|
|
3 |
p. 207-236
30 p.
|
artikel
|
| 59 |
On geometric and topological reasoning in robotics
|
J. Pfalzgraf
|
|
1997
|
|
3 |
p. 279-318
40 p.
|
artikel
|
| 60 |
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
|
E. Boros
|
|
2003
|
|
3 |
p. 211-221
11 p.
|
artikel
|
| 61 |
On Semidefinite Programming Relaxations of (2p)-SAT
|
E. de Klerk
|
|
2003
|
|
3 |
p. 285-305
21 p.
|
artikel
|
| 62 |
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
|
Jeffrey Jackson
|
|
2003
|
|
3 |
p. 291-313
23 p.
|
artikel
|
| 63 |
On the topological structure of configuration spaces
|
Jürgen Sellen
|
|
1997
|
|
3 |
p. 335-354
20 p.
|
artikel
|
| 64 |
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
|
Fumiaki Okushi
|
|
2004
|
|
3 |
p. 373-401
29 p.
|
artikel
|
| 65 |
Practical reasoning using values: an argumentative approach based on a hierarchy of values
|
Teze, Juan C. L.
|
|
|
|
3 |
p. 293-319
|
artikel
|
| 66 |
Preface to the special issue
|
Franco, John
|
|
2011
|
|
3 |
p. 155-157
|
artikel
|
| 67 |
Probability, coherent belief and coherent belief changes
|
Cantwell, John
|
|
|
|
3 |
p. 259-291
|
artikel
|
| 68 |
Reasoning about the Elementary Functions of Complex Analysis
|
Russell Bradford
|
|
2002
|
|
3 |
p. 303-318
16 p.
|
artikel
|
| 69 |
Reasoning on temporal class diagrams: Undecidability results
|
Artale, Alessandro
|
|
2006
|
|
3 |
p. 265-288
|
artikel
|
| 70 |
Reasoning with BKBs Algorithms and Complexity
|
Tzachi Rosen
|
|
2004
|
|
3 |
p. 403-425
23 p.
|
artikel
|
| 71 |
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
|
Emmanuel Benoist
|
|
2003
|
|
3 |
p. 251-272
22 p.
|
artikel
|
| 72 |
Resolution Proofs of Matching Principles
|
Alasdair Urquhart
|
|
2003
|
|
3 |
p. 241-250
10 p.
|
artikel
|
| 73 |
Satisfiability-Based Algorithms for Boolean Optimization
|
Vasco M. Manquinho
|
|
2004
|
|
3 |
p. 353-372
20 p.
|
artikel
|
| 74 |
Semantics and expressiveness of disjunctive ordered logic
|
Francesco Buccafurri
|
|
1999
|
|
3 |
p. 311-337
27 p.
|
artikel
|
| 75 |
Similarity measures in formal concept analysis
|
Alqadah, Faris
|
|
2011
|
|
3 |
p. 245-256
|
artikel
|
| 76 |
Social choice rules driven by propositional logic
|
Camps, Rosa
|
|
2013
|
|
3 |
p. 279-312
|
artikel
|
| 77 |
Solving Hierarchical Constraints over Finite Domains with Local Search
|
Martin Henz
|
|
2004
|
|
3 |
p. 283-301
19 p.
|
artikel
|
| 78 |
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights
|
Hans van Maaren
|
|
2003
|
|
3 |
p. 273-283
11 p.
|
artikel
|
| 79 |
Tableau-based automata construction for dynamic linear time temporal logic*
|
Giordano, Laura
|
|
2006
|
|
3 |
p. 289-315
|
artikel
|
| 80 |
Tabling for nonmonotonic programming
|
Terrance Swift
|
|
1999
|
|
3 |
p. 201-240
40 p.
|
artikel
|
| 81 |
Time Series Generation by Recurrent Neural Networks
|
A. Priel
|
|
2003
|
|
3 |
p. 315-332
18 p.
|
artikel
|
| 82 |
Tractable plan existence does not imply tractable plan generation
|
Peter Jonsson
|
|
1998
|
|
3 |
p. 281-296
16 p.
|
artikel
|
| 83 |
Two AGM-style characterizations of model repair
|
Guerra, Paulo T.
|
|
|
|
3 |
p. 233-257
|
artikel
|
| 84 |
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems
|
Oliver Kullmann
|
|
2004
|
|
3 |
p. 303-352
50 p.
|
artikel
|
| 85 |
Used car salesman problem: A differential auction–barter market
|
Özturan, Can
|
|
2005
|
|
3 |
p. 255-267
|
artikel
|
| 86 |
Using computational learning strategies as a tool for combinatorial optimization
|
Andreas Birkendorf
|
|
1998
|
|
3 |
p. 237-257
21 p.
|
artikel
|
| 87 |
Using multi-agent simulation to understand trading dynamics of a derivatives market
|
King, Alan J.
|
|
2005
|
|
3 |
p. 233-253
|
artikel
|
| 88 |
Volume Index
|
|
|
2004
|
|
3 |
p. 427-430
5 p.
|
artikel
|
| 89 |
Why-provenance information for RDF, rules, and negation
|
Analyti, Anastasia
|
|
2013
|
|
3 |
p. 221-277
|
artikel
|
Tijdschrift beschrijving