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

David B. Skalak

dblp:62/1493 · DBLP profile ↗
← Back
12ranked-venue papers
5as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 10 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

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.

Artificial intelligence
4 papers
Knowledge representation and reasoning · 87% Deep learning architectures and training · 13%
Theoretical computer science
2 papers
Algorithms and data structures · 46% Mathematical optimization · 46% Automated reasoning and model checking · 9%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
case-based reasoning
0.031994
Heuristic Harvesting of Information for Case-Based Argument · AAAI 1994
Case-Based Diagnostic Analysis in a Blackboard Architecture · AAAI 1993
Combining Case-Based and Rule-Based Reasoning: A Heuristic Approach · IJCAI 1989
Knowledge, reasoning and agents › Knowledge representation and reasoning
argumentation
0.011994
Heuristic Harvesting of Information for Case-Based Argument · AAAI 1994
Mathematical optimization › sparse learning
feature selection
0.011994
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms · ICML 1994
Information retrieval
case-based retrieval
0.011993
Case Retrieval through Multiple Indexing and Heuristic Search · IJCAI 1993
Information retrieval
heuristic search
0.011993
Case Retrieval through Multiple Indexing and Heuristic Search · IJCAI 1993
Machine learning › Deep learning architectures and training
hybrid architecture
0.011991
CABARET: Rule Interpretation in a Hybrid Architecture · Int. J. Man Mach. Stud. 1991
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge-based systems › rule-based systems
rule-based reasoning
0.011991
CABARET: Rule Interpretation in a Hybrid Architecture · Int. J. Man Mach. Stud. 1991
Knowledge, reasoning and agents › Knowledge representation and reasoning › cognitive modeling › cognitive architecture
blackboard architecture
0.011993
Case-Based Diagnostic Analysis in a Blackboard Architecture · AAAI 1993

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

sampling · 0.0random mutation hill climbing · 0.0heuristic · 0.0
YearPublicationVenuePosition
2007 Classifier Loss Under Metric Uncertainty
David B. Skalak, Alexandru Niculescu-Mizil, Rich Caruana
ECML1
1994 Heuristic Harvesting of Information for Case-Based Argument
Edwina L. Rissland, David B. Skalak, Timur Friedman
AAAI2
1994 Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
David B. Skalak
ICML1
1993 Case-Based Diagnostic Analysis in a Blackboard Architecture
Edwina L. Rissland, Jody J. Daniels, Zachary B. Rubinstein, David B. Skalak
AAAI4
1993 BankXX: A Program to Generate Argument Through Case-Base Research
abstract
In this paper we describe a system, called BankXX, which generates arguments by performing a heuristic best-first search of a highly interconnected network of legal knowledge. The legal knowledge includes cases represented from a variety of points of view—cases as collections of facts, cases as dimensionally-analyzed fact situations, cases as bundles of citations, and cases as prototypical factual scripts—as well as legal theories represented in terms of domain factors. BankXX performs its search for useful information using one of three evaluation functions encoded at different levels of abstraction: the domain level, an “argument-piece” level, and the overall argument level. Evaluation at the domain level uses easily accessible information about the nodes, such as their type; evaluation at the argument-piece level uses information about generally useful components of case-based argument, such as best cases and supporting legal theories; evaluation at the overall-argument level uses factors, called argument dimensions, which address the overall substance and quality of an argument, such as the centrality of its supporting cases or the success record of its best theory. BankXX is instantiated in the area of personal bankruptcy governed by Chapter 13 of the U.S. Bankruptcy Code, which permits a debtor to be discharged from debts through completion of a court-approved payment plan. In particular, our system addresses the requirement that such Chapter 13 plans be “proposed in good faith.”
Edwina L. Rissland, David B. Skalak, Timur Friedman
ICAIL2
1993 Case Retrieval through Multiple Indexing and Heuristic Search
Edwina L. Rissland, David B. Skalak, Timur Friedman
IJCAI2
1991 Argument Moves in a Rule-Guided Domain
abstract
We discuss a theoqy of heurtitic strategies and tactics for making arguments in a domain guided by rules where the primary task is to use previous cases to argue for a particular interpretation of a rule in a new fact situation.Since rules frequently have various problematic aspects, such as unstated exceptions or prerequisites, or use terms that are not clearly defined, the actual interpretation is a matter of debate, and the arguer must use interpretations from precedent cases to form his argument.The argument strategies and tactics actually adopted depend on the arguer's point of view and the complexwn of his case in light of the rules and the precedents.The tactics, called "moves" here, are ultimately expressed in a small set of generic "argument primitives, " such as analogizing and distinguishing.We discuss how these argument strategies, moves, and primitives are used by our mixed paradigm system, CABARET (Roland & Skalak, 1990).We illustrate with examples from an area of U.S. Federal income tax law.
David B. Skalak, Edwina L. Rissland
ICAIL1
1991 CABARET: Rule Interpretation in a Hybrid Architecture
Edwina L. Rissland, David B. Skalak
Int. J. Man Mach. Stud.2
1990 Inductive Learning in a Mixed Paradigm Setting
David B. Skalak, Edwina L. Rissland
AAAI1
1989 Interpreting Statutory Predicates
abstract
In this paper we discuss a hybrid approach to the problem of statutory interpretation that involves combining our past approach to case-based reasoning (“CBA”), as exemplified in our previous HYPO and TAX-HYPO systems, with traditional rule-based reasoning (“RBR”), as exemplified by expert systems. We do not tackle the fullblown version of statutory interpretation, which would include reasoning with legislative intent or other normative aspects (the “ought”), but confine ourselves to reasoning with explicit cases and rules. We discuss strategies that can be used to guide interpretation, particularly the interleaving of CBR and RBR, and how they are used in an agenda-based architecture, called CABARET, which we are currently developing in a general way and experimenting with in the particular area of Section §280A(c)(1) of the U.S. Internal Revenue Code, which deals with the so called “home office deduction”.
Edwina L. Rissland, David B. Skalak
ICAIL2
1989 Taking Advantage of Models for Legal Classification
abstract
Legal reasoning is often couched in terms of legal classification. We examine how three models of classification — Classical, Probabilistic and Exemplar — are used to perform legal classification. We argue that all three models of classification are implicitly applied by existing AI methods. The CABARET (“CAse-BAsed REasoning Tool”) system is suggested as an architecture that applies all three models. The relative difficulty of revising knowledge in rule form, in HYPO-style dimension form, and exemplar form is considered.
David B. Skalak
ICAIL1
1989 Combining Case-Based and Rule-Based Reasoning: A Heuristic Approach
Edwina L. Rissland, David B. Skalak
IJCAI2