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

Dario Sartini

dblp:70/3256 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Software engineering, systems software and programming languages · 1Theory of computation · 1Applied, interdisciplinary, general and emerging 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
1 paper
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 77% Logic in computer science · 23%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › automated reasoning
inference control
0.011986
Representation and use of metaknowledge · Proc. IEEE 1986
Knowledge, reasoning and agents › Knowledge representation and reasoning › epistemic reasoning
metaknowledge
0.011986
Representation and use of metaknowledge · Proc. IEEE 1986
Automated reasoning and model checking
automated theorem proving
0.011986
Representation and use of metaknowledge · Proc. IEEE 1986
Logic in computer science › logic programming
horn clauses
0.011986
Representation and use of metaknowledge · Proc. IEEE 1986

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

metalevel reasoning · 0.0
YearPublicationVenuePosition
1987 Evaluating Logic Programs via Set-Valued Functions
Carlo Cecchi, Dario Sartini, Luigia Carlucci Aiello
ICLP2
1986 Representation and use of metaknowledge
abstract
The need for expressing and using metalevel knowledge is emerging in the design of several kinds of AI systems. The careful distinction between object-level and metalevel notions and the formalization of the latter has first been carried out by logicians for foundational reasons; subsequently, the distinction has been exploited in Artificial Intelligence and Computation Theory, revealing itself to be of great relevance to Automated Deduction and Problem Solving. This paper concentrates on the use of metaknowledge in building knowledge-based systems. In order to introduce the issue, some motivating examples are presented. We then review various paradigms for combining knowledge and metaknowledge, with the aim of abstracting general criteria that should underly the construction of viable AI systems, as far as metaknowledge is concerned. Furthermore, a general overview of the uses of metaknowledge in AI is provided and, among them, we concentrate on inference control, which can be conveniently exercised by formalizing control strategies at the metalevel and by letting the inference engine depend on metalevel descriptions. The technique is presented with the aid of some examples, chosen from practical AI applications, that are expressed in the formalism of Horn clause logic. The issue of self-descriptive systems is then addressed. A system that embodies and can use an adequate description of itself allows for self-evaluation (e.g., the estimate of the resources needed to perform a given task) and for self-modification (e.g., the automatic improvement of deduction performance by profiting from experience gained in previous deductions).
Luigia Carlucci Aiello, Carlo Cecchi, Dario Sartini
Proc. IEEE3