FO2 groundings can require 2^Ω(n) DNNF size, but a type-based compiler with residual caching often yields smaller circuits and faster runtimes than naive grounding.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
BLINKG is a benchmark for evaluating LLMs on mapping input data schemas to ontology concepts for knowledge graph construction, with experiments showing promising but limited performance in complex real-world scenarios.
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
citing papers explorer
-
On Knowledge Compilation For Two-Variable First-Order Logic
FO2 groundings can require 2^Ω(n) DNNF size, but a type-based compiler with residual caching often yields smaller circuits and faster runtimes than naive grounding.
-
BLINKG: A Benchmark for LLM-Integrated Knowledge Graph Generation
BLINKG is a benchmark for evaluating LLMs on mapping input data schemas to ontology concepts for knowledge graph construction, with experiments showing promising but limited performance in complex real-world scenarios.
-
Brief announcement: A special case of maximum flow over time with network changes
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.