| 2004 |
|---|
| 43 | EE | Orkunt Sabuncu,
Ferda Nur Alpaslan,
Varol Akman:
Using Criticalities as a Heuristic for Answer Set Programming.
LPNMR 2004: 234-246 |
| 42 | EE | Varol Akman,
Selim T. Erdogan,
Joohyung Lee,
Vladimir Lifschitz,
Hudson Turner:
Representing the Zoo World and the Traffic World in the language of the Causal Calculator.
Artif. Intell. 153(1-2): 105-140 (2004) |
| 2003 |
|---|
| 41 | EE | Orkunt Sabuncu,
Ferda Nur Alpaslan,
Varol Akman:
Using Criticalities as a Heuristics for Answer Set Programming.
Answer Set Programming 2003 |
| 40 | EE | Varol Akman:
Reading McDermott.
Artif. Intell. 151(1-2): 227-235 (2003) |
| 2002 |
|---|
| 39 | EE | Ayisigi B. Sevdik,
Varol Akman:
Internet in the Lives of Turkish Women.
First Monday 7(3): (2002) |
| 38 | EE | Kemal Altintas,
Tolga Aydin,
Varol Akman:
Censoring the Internet: The Situation in Turkey.
First Monday 7(6): (2002) |
| 2001 |
|---|
| 37 | | Varol Akman,
Paolo Bouquet,
Richmond H. Thomason,
Roger A. Young:
Modeling and Using Context, Third International and Interdisciplinary Conference, CONTEXT, 2001, Dundee, UK, July 27-30, 2001, Proceedings
Springer 2001 |
| 2000 |
|---|
| 36 | | Varol Akman:
Introduction to the special issue on philosophical foundations of artificial intelligence.
J. Exp. Theor. Artif. Intell. 12(3): 247-250 (2000) |
| 35 | | Varol Akman,
Patrick Blackburn:
Editorial: Alan Turing and Artificial Intelligence.
Journal of Logic, Language and Information 9(4): 391-395 (2000) |
| 1999 |
|---|
| 34 | EE | Varol Akman,
Ferda Nur Alpaslan:
Strawson on Intended Meaning and Context.
CONTEXT 1999: 1-14 |
| 1998 |
|---|
| 33 | EE | Varol Akman:
Book review: Mind Design II Philosophy, Psychology, and Artificial Intelligence John Haugeland, editor(A 5radford Book The MIT Press Cambridge, MA, 1997 476 pp. ISBN 0-262-58t53-1 (paper) $t9.50 tSBN 0-262-08259-4 (cloth) $40.00).
SIGART Bulletin 9(3-4): 33-36 (1998) |
| 1997 |
|---|
| 32 | | Erkan Tin,
Varol Akman:
Situated Nonmonotonic Temporal Reasoning with BABY-SIT.
AI Commun. 10(2): 93-109 (1997) |
| 31 | | Varol Akman,
Mehmet Surav:
The Use of Situation Theory in Context Modeling.
Computational Intelligence 13(3): 427-438 (1997) |
| 30 | | Varol Akman:
John Barwise and Lawrence Moss, Vicious Circles: On the mathematics of Non-Wellfounded Phenomena.
Journal of Logic, Language and Information 6(4): 460-464 (1997) |
| 1996 |
|---|
| 29 | | Varol Akman,
Mehmet Surav:
Steps Toward Formalizing Context.
AI Magazine 17(3): 55-72 (1996) |
| 28 | EE | Erkan Tin,
Varol Akman:
Situations and Computation: An Overview of Recent Research
CoRR cmp-lg/9602002: (1996) |
| 27 | | Varol Akman,
Müjdat Pakkan:
Nonstandard Set Theories and Information Management.
J. Intell. Inf. Syst. 6(1): 5-31 (1996) |
| 1995 |
|---|
| 26 | | Varol Akman:
V. Lifschitz, ed., Formalizing Common Sense: Papers by John McCarthy.
Artif. Intell. 77(2): 359-369 (1995) |
| 25 | | Müjdat Pakkan,
Varol Akman:
HYPERSOLVER: A Graphical Tool for Commonsense Set Theory.
Inf. Sci. 85(1-3): 43-61 (1995) |
| 24 | EE | Murat Ersan,
Varol Akman:
Situated Modeling of Epistemic Puzzles.
Logic Journal of the IGPL 3(1): 51-76 (1995) |
| 23 | | Erkan Tin,
Varol Akman,
Murat Ersan:
Towards Situation-Oriented Programming Languages.
SIGPLAN Notices 30(1): 27-36 (1995) |
| 1994 |
|---|
| 22 | | Müjdat Pakkan,
Varol Akman:
Issues in Commonsense Set Theory.
Artif. Intell. Rev. 8(4): 279-308 (1994) |
| 21 | EE | Marko Marhl,
Varol Akman:
On the correct determination of rotational angles for twisted-profiled sweep objects.
Computers & Graphics 18(5): 691-694 (1994) |
| 20 | | Erkan Tin,
Varol Akman:
Computational Situation Theory.
SIGART Bulletin 5(4): 4-17 (1994) |
| 1992 |
|---|
| 19 | EE | Varol Akman,
Ahmet Arslan:
Sweeping with all graphical ingredients in a topological picturebook.
Computers & Graphics 16(3): 273-281 (1992) |
| 18 | | Erkan Tin,
Varol Akman:
Computing with Causal Theories.
IJPRAI 6(4): 699-730 (1992) |
| 1991 |
|---|
| 17 | | Varol Akman:
Undaunted Sets.
Bulletin of the EATCS 45: 146-147 (1991) |
| 16 | | Varol Akman:
Implementation of Karp-Luby Monte Carlo Method: An Exercise in Approximate Counting.
Comput. J. 34(3): 279-282 (1991) |
| 1990 |
|---|
| 15 | | Varol Akman:
Review of Actors: A Model of Concurrent Computation in Distributed Systems.
AI Magazine 11(4): 92-95 (1990) |
| 14 | EE | Varol Akman:
'Snapshot' of geometric reasoning : Geometric Reasoning J Woodwark (ed) Clarendon Press, Oxford (1989) xvi + 282 pp.
Computer-Aided Design 22(10): 675-676 (1990) |
| 13 | EE | Varol Akman,
Paul J. W. ten Hagen,
Tetsuo Tomiyama:
A fundamental and theoretical framework for an intelligent CAD system.
Computer-Aided Design 22(6): 352-367 (1990) |
| 1989 |
|---|
| 12 | | Varol Akman,
Paul J. W. ten Hagen:
The Power of Physical Representations.
AI Magazine 10(3): 49-65 (1989) |
| 11 | EE | Varol Akman,
Wm. Randolph Franklin:
Representing objects as rays, or how to pile up an octree?
Computers & Graphics 13(3): 373-379 (1989) |
| 10 | EE | Varol Akman,
Wm. Randolph Franklin:
Ray representation for k-trees.
Pattern Recognition Letters 10(5): 315-320 (1989) |
| 1988 |
|---|
| 9 | | Wm. Randolph Franklin,
Varol Akman:
Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation.
Comput. J. 31(1): 56-60 (1988) |
| 1987 |
|---|
| 8 | | Varol Akman:
Unobstructed Shortest Paths in Polyhedral Environments
Springer 1987 |
| 7 | | Varol Akman,
Paul J. W. ten Hagen,
Alfons A. M. Kuijk:
A Vector-like Architecture for Raster Graphics.
Advances in Computer Graphics Hardware 1987: 137-154 |
| 6 | | Alfons A. M. Kuijk,
Paul J. W. ten Hagen,
Varol Akman:
An Exact Incremental Hidden Surface Removal Algorithm.
Advances in Computer Graphics Hardware 1987: 21-37 |
| 5 | EE | Wm. Randolph Franklin,
Varol Akman:
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.
Comput. Graph. Forum 6(2): 103-109 (1987) |
| 4 | | Varol Akman:
An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon.
Inf. Process. Lett. 24(3): 193-198 (1987) |
| 1986 |
|---|
| 3 | | Wm. Randolph Franklin,
Varol Akman:
Reconstructing Visible Regions from Visible Segments.
BIT 26(4): 430-441 (1986) |
| 2 | | Varol Akman,
Wm. Randolph Franklin:
On the question "Is Sigma (between 1 and n) root a1 =< L?".
Bulletin of the EATCS 28: 16-19 (1986) |
| 1985 |
|---|
| 1 | | Wm. Randolph Franklin,
Varol Akman,
Colin Verrilli:
Voronoi diagrams with barriers and on polyhedra for minimal path planning.
The Visual Computer 1(2): 133-150 (1985) |
