MétaCan
Menu
Back to cohort

ID-logic and the ramification problem for the situation calculus

2000· article· en· W12780597 on OpenAlexaff
Eugenia Ternovskaia

Bibliographic record

VenueEuropean Conference on Artificial Intelligence · 2000
Typearticle
Languageen
FieldComputer Science
TopicLogic, Reasoning, and Knowledge
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsSuccessor cardinalAxiomNegationMathematicsInductive logic programmingAutoepistemic logicCalculus (dental)Computer scienceAlgebra over a fieldMultimodal logicTheoretical computer scienceArtificial intelligenceDescription logicProgramming languagePure mathematics

Abstract

fetched live from OpenAlex

The goal of this paper is to extend the general solution to the ramification problem for the situation calculus to the case where causal rules specifying indirect effects of actions may form cycles or cycles through negation. We formulate causal dependencies as rules of inductive definitions. Then we give a semantics to a logic for representing inductive definitions (ID-logic) by translating definitions to sentences of fixed-point logic. We describe a regression-based procedure for generating successor state axioms from inductive rules, and consider several benchmark examples. Finally, we show that boundedness is a sufficient condition for translating causal theories to successor state axioms.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.009
Threshold uncertainty score0.043

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0040.004
Science and technology studies0.0040.008
Scholarly communication0.0080.019
Open science0.0030.007
Research integrity0.0030.008
Insufficient payload (model declined to judge)0.0090.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.291
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueEuropean Conference on Artificial IntelligenceSame topicLogic, Reasoning, and KnowledgeFrench-language works237,207