{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6FOS2VPZ5MWJOBBB45SRVSXEVK","short_pith_number":"pith:6FOS2VPZ","schema_version":"1.0","canonical_sha256":"f15d2d55f9eb2c970421e7651acae4aa8ff14b761c8e59df87c7ad0f0af3a995","source":{"kind":"arxiv","id":"1507.02456","version":2},"attestation_state":"computed","paper":{"title":"Towards Log-Linear Logics with Concrete Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heiner Stuckenschmidt, Jakob Huber, Melisachew Wudage Chekol","submitted_at":"2015-07-09T11:02:38Z","abstract_excerpt":"We present $\\mathcal{MEL}^{++}$ (M denotes Markov logic networks) an extension of the log-linear description logics $\\mathcal{EL}^{++}$-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent $\\mathcal{EL}^{++}$ ontology from an $\\mathcal{MEL}^{++}$ knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending MLN's cutting plane inference (CPI) algorithm."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.02456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-09T11:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"995e20985ab5b69b9ee3565f8dca0eb767d82923905364ccbcec1d8540acaa83","abstract_canon_sha256":"a5f0b29d7c5309f6e0099baa90b2471dbe5b0cc41150e068c251ebebf1d6c750"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:49.443265Z","signature_b64":"H2bl9GDA23a006ElWMhbxIxYnPW6LgfyPEQBooMH1c4YYt5Q2aVNMDdqHuxjsd+CYlHz9jMydW/dB9OnC9gqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15d2d55f9eb2c970421e7651acae4aa8ff14b761c8e59df87c7ad0f0af3a995","last_reissued_at":"2026-05-18T01:36:49.442658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:49.442658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Log-Linear Logics with Concrete Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heiner Stuckenschmidt, Jakob Huber, Melisachew Wudage Chekol","submitted_at":"2015-07-09T11:02:38Z","abstract_excerpt":"We present $\\mathcal{MEL}^{++}$ (M denotes Markov logic networks) an extension of the log-linear description logics $\\mathcal{EL}^{++}$-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent $\\mathcal{EL}^{++}$ ontology from an $\\mathcal{MEL}^{++}$ knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending MLN's cutting plane inference (CPI) algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02456","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.02456","created_at":"2026-05-18T01:36:49.442753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02456v2","created_at":"2026-05-18T01:36:49.442753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02456","created_at":"2026-05-18T01:36:49.442753+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FOS2VPZ5MWJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FOS2VPZ5MWJOBBB","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FOS2VPZ","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK","json":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK.json","graph_json":"https://pith.science/api/pith-number/6FOS2VPZ5MWJOBBB45SRVSXEVK/graph.json","events_json":"https://pith.science/api/pith-number/6FOS2VPZ5MWJOBBB45SRVSXEVK/events.json","paper":"https://pith.science/paper/6FOS2VPZ"},"agent_actions":{"view_html":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK","download_json":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK.json","view_paper":"https://pith.science/paper/6FOS2VPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02456&json=true","fetch_graph":"https://pith.science/api/pith-number/6FOS2VPZ5MWJOBBB45SRVSXEVK/graph.json","fetch_events":"https://pith.science/api/pith-number/6FOS2VPZ5MWJOBBB45SRVSXEVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK/action/storage_attestation","attest_author":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK/action/author_attestation","sign_citation":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK/action/citation_signature","submit_replication":"https://pith.science/pith/6FOS2VPZ5MWJOBBB45SRVSXEVK/action/replication_record"}},"created_at":"2026-05-18T01:36:49.442753+00:00","updated_at":"2026-05-18T01:36:49.442753+00:00"}