Bernard Nudel

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:93/4259 · DBLP profile ↗

← Back

5ranked-venue papers

3as first author

0since 2021 · last 1983

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 3 papers		Computational complexity · 65% Algorithms and data structures · 35%
Artificial intelligence 3 papers		Planning, search and constraint satisfaction · 64% Knowledge representation and reasoning · 36%
Databases, data mining, and information retrieval 1 paper		Machine learning and data management · 100%

Topics — the 6 heaviest of 9, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Algorithms and data structures › analysis of algorithms expected complexity	2	1983	Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics · Artif. Intell. 1983 Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities · AAAI 1983
Computational complexity › constraint satisfaction consistent labeling	2	1983	Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities · AAAI 1983 Consistent-Labeling Problems and Their Algorithms · AAAI 1982
Computational complexity constraint satisfaction	2	1983	Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities · AAAI 1983 Consistent-Labeling Problems and Their Algorithms · AAAI 1982
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction consistent labeling	1	1983	Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics · Artif. Intell. 1983
Knowledge, reasoning and agents › Knowledge representation and reasoning expert systems	1	1979	Learning Production Rules for Consultation Systems · IJCAI 1979
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge-based systems › rule-based systems production rules	1	1979	Learning Production Rules for Consultation Systems · IJCAI 1979

Methods — techniques the papers use, named apart from their topics

theory-based heuristics · 0.0expected-complexity analysis · 0.0

Year	Publication	Venue	Position
1983	Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities Bernard Nudel	AAAI	1
1983	Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics Bernard Nudel	Artif. Intell.	1
1982	Consistent-Labeling Problems and Their Algorithms Bernard Nudel	AAAI	1
1981	Learning Problem-Solving Heuristics Through Practice Tom M. Mitchell, Paul E. Utgoff, Bernard Nudel, Ranan B. Banerji	IJCAI	3
1979	Learning Production Rules for Consultation Systems Sholom M. Weiss, Casimir A. Kulikowski, Bernard Nudel	IJCAI	3