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

William S. Havens

dblp:h/WSHavens · DBLP profile ↗
← Back
13ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Artificial intelligence and machine learning · 11 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-authorSoftware engineering, systems software and programming languages · 2

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
2 papers
Mathematical optimization · 66% Combinatorics and discrete mathematics · 20% Computational complexity · 14%
Artificial intelligence
4 papers
Knowledge representation and reasoning · 58% Planning, search and constraint satisfaction · 42%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
scheduling
0.012004
The U.S. National Football League Scheduling Problem · AAAI 2004
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
constraint-based reasoning
0.011989
Platypus: A Constraint-Based Reasoning System · IJCAI 1989
Knowledge, reasoning and agents › Knowledge representation and reasoning › representation language › knowledge representation formalisms
visual knowledge representation
0.011988
Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach · IEEE Trans. Pattern Anal. Mach. Intell. 1988
Computational complexity › constraint satisfaction › constraint propagation
arc consistency
0.011988
Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach · IEEE Trans. Pattern Anal. Mach. Intell. 1988
Computational complexity
constraint satisfaction
0.011988
Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach · IEEE Trans. Pattern Anal. Mach. Intell. 1988

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

hierarchical arc-consistency · 0.0knowledge representation · 0.0
YearPublicationVenuePosition
2008 Probabilistic Nogood Store as a Heuristic
Andrei Missine, William S. Havens
PRICAI2
2005 Extending Systematic Local Search for Job Shop Scheduling Problems
Bistra Dilkina, Lei Duan, William S. Havens
CP3
2004 The U.S. National Football League Scheduling Problem
Bistra Dilkina, William S. Havens
AAAI2
2000 An Empirical Study of Probabilistic Arc Consistency
Michael C. Horsch, William S. Havens
CP2
2000 Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
Michael C. Horsch, William S. Havens
UAI2
1996 Nicolog: A Simple Yet Powerful cc(FD) Language
Greg Sidebottom, William S. Havens
J. Autom. Reason.2
1994 NSAIL PLAN: an experience with constraint-based reasoning in planning and animation
abstract
A constraint-based reasoning system is used for knowledge representation and reasoning in behavioural animation, specifically in the animation of sailing behaviour. The object-oriented ECHIDNA reasoning and constraint logic programming shell handles the constraints for formulation and execution of plans for intelligent entities. At higher levels of control, the observed motion of an object is a reflection of the reasoning process of an intelligent entity as it reacts to its environment. The environment, internal knowledge and physical structure serve as constraints in developing a plan, which in turn provides additional constraints in the animation of reactive behaviour. An animation approach using constraint-based reasoning is presented focusing on details of the planning process adapted in the approach. The implementation of the NSAIL program reveals further insight into applying this approach towards the development of a high-level intuitive interface for behavioural animation. >
Sang Mah, Thomas W. Calvert, William S. Havens
CA3
1994 A Constraint-Based Reasoning Framework for Behavioural Animation
abstract
Abstract Behaviour is a reflection of a reasoning process that must deal with constraints imposed by an external environment, internal knowledge and physical structure. This paper proposes a framework for behavioural animation that is based on the next generation of object‐oriented, constraint‐based expert systems technology, and applies a control structure of knowledge agents and knowledge units to determine the behaviour of objects to be animated. Knowledge agents are responsible for planning, plan implementation and information extraction from the environment. The activity of an agent is dependent on the knowledge units ascribed to them by the animator. The interaction between agents and knowledge units is resolved by the reasoning engine, and thus, influences the eventual motion displayed. An example given is NSAIL, a pilot implementation using the model‐based ECHIDNA constraint logic programming shell. With this approach, the motion for a sailing scenario and other behavioural domains can be specified at a high level through the characterization of the knowledge agents.
Sang Mah, Thomas W. Calvert, William S. Havens
Comput. Graph. Forum3
1992 Hierarchical Arc Consistency for Disjoint Real Intervals in Constraint Logic Programming
abstract
There have been many proposals for adding sound implementations of numeric processing to Prolog. This paper describes an approach to numeric constraint processing which has been implemented in Echidna, a new constraint logic programming (CLP) language. Echidna uses consistency algorithms which can actively process a wider variety of numeric constraints than most other CLP systems, including constraints containing some common nonlinear functions. A unique feature of Echidna is that it implements domains for real‐valued variables with hierarchical data structures and exploits this structure using a hierarchical arc consistency algorithm specialized for numeric constraints. This gives Echidna two advantages over other systems. First, the union of disjoint intervals can be represented directly. Other approaches require trying each disjoint interval in turn during backtrack search. Second, the hierarchical structure facilitates varying the precision of constraint processing. Consequently, it is possible to implement more effective constraint processing control algorithms which avoid unnecessary detailed domain analysis. These advantages distinguish Echidna from other CLP systems for numeric constraint processing.
Greg Sidebottom, William S. Havens
Comput. Intell.2
1989 Platypus: A Constraint-Based Reasoning System
William S. Havens, Paul Stephen Rehfuss
IJCAI1
1988 Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach
abstract
Schema-based representations for visual knowledge are integrated with constraint satisfaction techniques. This integration is discussed in a progression of three sketch map interpretation programs: Mapsee-1, Mapsee-2, and Mapsee-3. The programs are evaluated by the criteria of descriptive and procedural adequacy. The evaluation indicates that a schema-based representation used in combination with a hierarchical arc-consistency algorithm constitutes a modular, efficient, and effective approach to the structured representation of visual knowledge. The schemata used in this representation are embedded in composition and specialization hierarchies. Specialization hierarchies are further expanded into discrimination graphs.>
Jan A. Mulder, Alan K. Mackworth, William S. Havens
IEEE Trans. Pattern Anal. Mach. Intell.3
1981 Structuring Domain Knowledge For Visual Perception
Alan K. Mackworth, William S. Havens
IJCAI2
1977 A Procedural Model of Recognition
William S. Havens
IJCAI1