Corpus ID: 62436989

AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java for Artificial Intelligence: Structures and Strategies for Complex Problem Solving

@inproceedings{Luger2008AIAD,
  title={AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java for Artificial Intelligence: Structures and Strategies for Complex Problem Solving},
  author={George F. Luger and William A. Stubblefield},
  year={2008}
}
SolutionNode defines the basic functionality for every node of the graph, including the abstract method nextSolution(). AbstractSolutionNode and its descendants will implement the ability to search the and/or graph, to save the state of the search, and to resume on subsequent calls to nextSolution(). Luger_all_wcopyright_COsfixed.pd351 351 5/15/2008 6:37:00 PM 336 Part IV: Programming in Java The class RuleSet maintains the logic base, a list of rules. The intention is that all nodes will use… Expand
A Functional Programming Approach to AI Search Algorithms
TLDR
This paper introduces a new approach for presenting these algorithms related to state-space represented problems to the students, which is programming them in a functional style using the F# programming language. Expand
Self-interpreter for Prolog
TLDR
A self-interpreter for Prolog is introduced, which is a formalization of the syntax and semantics of Prolog using Prolog, and this interpreter is a running program that mimics the depth-first, left-to-right evaluation strategy ofprolog interpreters. Expand
A Generative Hyper-Heuristic for Deriving Heuristics for Classical Artificial Intelligence Problems
TLDR
This study examines the automatic induction of low-level heuristics using hyper-heuristics for classical artificial intelligence and investigates the use of a generative hyper- heuristic to derive theseHeuristics. Expand
Generic interactive natural language interface to databases (GINLIDB)
TLDR
The design and implementation of a natural language interface to a database system called Generic Interactive Natural Language Interface to Databases (GINLIDB) is presented, designed by the use of UML and developed using Visual Basic. Expand
Topics in Programming Languages: A Philosophical Analysis Through the Case of Prolog
TLDR
The logic programming paradigm and Prolog are the most adequate paradigm and programming language to work on this subject, combining natural language processing and linguistics, logic programming and constriction methodology on both algorithms and procedures, on an overall philosophizing declarative status. Expand
Ontology COKB for Knowledge Representation and Reasoning in Designing Knowledge-Based Systems
  • N. Do
  • Computer Science
  • SoMeT
  • 2014
TLDR
This article presents an ontology called Ontology of Computational Object Knowledge Base (COKB), a model for representing problems together reasoning algorithms for solving them, and design methods to construct applications. Expand
A Fast Filtering Algorithm for Massive Context-free Grammars
TLDR
This work presents an algorithm called 'Terminal-tree filtering' (TTF), a new variant of the 'b-filtering' algorithm, which finds the same filtered set of grammar rules as the ' b-filter' for a given input, but which achieves new state-of-the-art run time and grammar size performance within in this problem space. Expand
Toward Flow-Based Ontology
TLDR
The paper proposes that the notion of flow can serve Zas a tool to support the hierarchical assembly of terms comprising the ontology and demonstrates a flow-based representation that seems to indicate a viable technique that can be incorporated into building ontologies for other domains. Expand
Adaptive and restarting techniques-based algorithms for circular packing problems
TLDR
A three-phase approximate algorithm to solve the circular packing problem (CPP), which consists of packing a set of non-identical circles of known radii into the smallest circle with no overlap of any pair of circles. Expand
Enhancing web search by using query-based clusters and multi-document summaries
TLDR
Experimental results show that the proposed query-based cluster and summarizer, called QSum, is effective and efficient in generating a high-quality summary for each cluster of documents on a specific topic. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
Prolog - the language and its implementation compared with Lisp
TLDR
It is argued that pattern matching is a better method for expressing operations on structured data than conventional selectors and constructors - both for the user and for the implementor. Expand
A Machine-Oriented Logic Based on the Resolution Principle
TLDR
The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process. Expand
Knowledge Systems and Prolog: A Logical Approach to Expert Systems and Natural Language Processing
TLDR
The book's main topic as far as natural language processing is concerned is the querying of structured databases in English, and the main applications are the knowledge system applications and the combination of the two. Expand
Techniques of Prolog Programming with Implementation of Logical Negation and Quantified Goals
TLDR
Offers a comprehensive exhibition of Prolog programming techniques in four stages--declarative, procedural, advanced and meta-programming, which presents simple and efficient implementation of logical negation and quantified goals which are necessary in expert systems. Expand
Logic Programming for the Real World
TLDR
It is believed that changing this situation and establishing logic programming as a major paradigm in the non-academic world is an appropriate objective for a successor to Prolog. Expand
The Art of Prolog - Advanced Programming Techniques
TLDR
This book discusses the programming techniques used in pure Prolog programming, including nondeterministic programming incomplete data structures second-order programming interpreters program transformation logic grammars search techniques and applications. Expand
Common LISP - a gentle introduction to symbolic computation
TLDR
A "toolkit" in each chapter explains how to use Common LISP programming and debugging tools such as DESCRIBE, INSPECT, TRACE and STEP. Expand
Managing Dynamic Contexts Using Failure-Driven Stochastic Models
We describe an architecture for representing and managing context shifts that supports dynamic data interpretation. This architecture utilizes two layers of learning and three layers of control forExpand
Learning Physical Descriptions From Functional Definitions, Examples, and Precedents
TLDR
The theory is a synthesis of two sets of ideas: ideas about learning from precedents and exercises developed at MIT and ideas about physical description developed at Stanford, and is illustrated by way of representative experiments. Expand
The Elements of Artificial Intelligence Using Common Lisp
From the Publisher: You can learn how to bring the principles and programming techniques of contemporary artificial intelligence to life with Steven Tanimoto's masterful introductory text.
...
1
2
3
...