Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference (Q2915079): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W91551036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear constraint satisfaction approach to cost-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-plane training of structural SVMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov logic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient LP-based admissible heuristic for cost-based abduction / rank
 
Normal rank

Latest revision as of 17:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference
scientific article

    Statements

    Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference (English)
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    abduction
    0 references
    cost-based abduction
    0 references
    cutting plane inference
    0 references
    integer linear programming
    0 references
    0 references