Laurent Siklóssy

According to our database1, Laurent Siklóssy authored at least 25 papers between 1970 and 2002.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
GPS peut toujours réussir...
Rev. d'Intelligence Artif., 2002

The way it was at Carnegie: 1965-1968.
Rev. d'Intelligence Artif., 2002

1997
Datum Discovery.
Proceedings of the Advances in Intelligent Data Analysis, 1997

1991
The Space Reduction Method: A Method to Reduce the Size of Search Spaces.
Inf. Process. Lett., 1991

Searching time-table networks.
Artif. Intell. Eng. Des. Anal. Manuf., 1991

1989
After 24 Years in AI: Some Lessons.
Proceedings of the Artificial Intelligence in Higher Education, 1989

1988
TRAINS, An Active Time-Table Searcher.
Proceedings of the 8th European Conference on Artificial Intelligence, 1988

1985
Semantic and pragmatic processing in FIDO: A flexible interface for data-base operations.
Inf. Syst., 1985

1982
Removing Restrictions in the Relational Data Base Model: An Application of Problem Solving Techniques.
Proceedings of the National Conference on Artificial Intelligence, 1982

1981
Efficient Query Evaluation in Relational Data Bases with Missing Values.
Inf. Process. Lett., 1981

1977
An Unobtrusive Computer Monitor for Multi-Step Problem Solving.
Int. J. Man Mach. Stud., 1977

The Role of Preprocessing in Problem Solving Systems.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977

1975
Model Verification and Improvement Using DISPROVER.
Artif. Intell., 1975

Automatic Program Synthesis from Example Problems.
Proceedings of the Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, 1975

1974
Collaborative Problem-Solving Between Optimistic and Pessimistic Problem Solvers.
Proceedings of the Information Processing, 1974

Simulation of executing robots in imperfectly known environments.
Proceedings of the American Federation of Information Processing Societies: 1974 National Computer Conference, 1974

Skeleton planning spaces for non-numeric heuristic optimization.
Proceedings of the 1974 ACM Annual Conference, 1974

1973
Breadth-First Search: Some Surprising Results.
Artif. Intell., 1973

Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973

An Efficient Robot Planner which Generates Its Own Procedures.
Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, 1973

1972
Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack.
Inf. Process. Lett., 1972

1971
Generalized means-ends analysis and artificial intelligence.
Inf. Sci., 1971

Heuristic Search vs. Exhaustive Search.
Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971

1970
On the evolution of artificial intelligence.
Inf. Sci., 1970

Computer tutors that know what they teach.
Proceedings of the American Federation of Information Processing Societies: Proceedings of the AFIPS '70 Fall Joint Computer Conference, 1970


  Loading...