Pith. sign in

REVIEW 3 major objections 4 minor 299 references

EntailLLM: Verifying LLM-Generated Vulnerability Discovery Paths with Domain Knowledge via Logic Programming

T0 review · 3 major / 4 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Requiring a separate domain-knowledge graph to entail every step of an LLM-proposed vulnerability path lifts pooled entailment from 78% to 98% across three CWE classes, four LLMs, three prompting strategies, and seven binaries.

desk verdict Genuinely new formalization of LLM path verification, but the headline 78→98% gain is heavily confounded by the +DK condition injecting the verifier's own vocabulary into the prompt; deserves a serious referee though the experimental design needs rework. read the letter →

arxiv 2608.01763 v1 pith:Y7UXWLAN submitted 2026-08-03 cs.CR cs.AIcs.LOcs.SE

Kaustuv Mukherji , Jaikrishna Manojkumar Patil , Colton Payne , Paulo Shakarian , Dana Warmsley , Nigel Stepp , Evelyn Kim This is my paper
classification cs.CRcs.AIcs.LOcs.SE
keywords LLMvulnerabilityanalysisentailmentcheckingtemporalannotatedlogicdomainknowledgegraphbinarydecompilationmedicaldevicefirmwaresecurityprogrammingverificationCWEweaknessclasses
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

EntailLLM claims that the way to make large language models reliable in vulnerability discovery is not to score or clean their output, but to treat each proposed analyst path as a hypothesis that a logic-based reasoner must prove. The path is a chain of code blocks in the binary's call graph; the proof is checked against a separate domain-knowledge graph encoding what is known about the vulnerability class, under temporal annotated logic whose deduction is exact and polynomial-time. Across three CWE classes, four LLMs, three prompting strategies, and seven binaries from 405 to 12,696 call-graph nodes, domain knowledge raises pooled entailment from 78% to 98%, decreasing in only 3 of 94 configurations. The strongest configuration, self-refinement paired with domain knowledge, raises the entailment rate from 71% to 97.4% while increasing the number of entailed paths by 37%. Because the system is deployed on real medical-device firmware and reaches 98% entailment without per-device tuning, the claim matters for safety-critical settings where a plausible-sounding but unsupported LLM inference can send an analyst or a fuzzer down the wrong path.

What carries the argument

Cross-graph entailment under temporal annotated logic. Generalized annotated logic attaches an interval [l, u] ⊆ [0,1] to each literal and treats unobserved literals as merely uncertain rather than false, so the partial, noisy observations a decompiler recovers from a stripped binary need not be forced to true or false. Time is explicit: the analyst is asserted at a code block at a time point, and rules carry a delay Δt. The path under test is a chain in the binary's call graph; the constraints live in a separate domain-knowledge graph of 105–188 entities and 232–403 relations per weakness class. Verification aligns the two: one of six traversal rules licenses a step only when a knowledge-gr

What would settle it

The decisive test is ground-truth reach: run the pipeline on a labeled corpus with confirmed vulnerabilities and compare how often entailed versus rejected paths actually arrive at a vulnerable function or call site. Matching rates would show that the 98% measures consistency with the authors' domain model, not real discovery. A cheaper check: randomize the domain graph's relation edges while keeping its structure and see whether the +DK gain survives; if a random graph still entails most paths, the filter is mostly structural.

Watch

Extended reading notes

Core claim

The central claim is that each LLM-proposed analyst path through a binary should be verified as a hypothesis before use: the path is encoded as temporal annotated facts, and a step is entailed only if the domain-knowledge program, a fixed set of 42 rules over graphs of 105–188 entities and 232–403 relations per weakness class, can chain from observed libc labels through knowledge-graph relations to license the analyst's move at that time point. Because generalized annotated logic computes its minimal model exactly in polynomial time, entailment is a proof, not a heuristic score: every accepted path is logically entailed by the encoded domain knowledge, and every rejection reports the first u

Load-bearing premise

The load-bearing premise, stated explicitly in the paper, is that the domain-knowledge graphs and the 42 hand-written logic rules are correct and fixed; if that semantics is wrong or incomplete, a high entailment rate only measures conformance to the authors' model, not real-world vulnerability behavior.

Editorial extensions

If this is right

  • Surviving paths are provably entailed by the encoded domain knowledge, so a human auditor gets an exact reasoning trace for every rejection — the first unsupported step plus the rule firings — rather than a confidence score.
  • Domain knowledge helps most where the unaided LLM is weakest: on medical-device binaries, self-refinement alone entails only 60.9% of realized paths, yet paired with domain knowledge it becomes the strongest configuration, raising pooled entailment to 97.4% and increasing the number of entailed paths by 37% (1,054 to 1,445).
  • The gain transfers without per-device tuning: real-device binaries start lower unaided (71.4% vs 84.4%) but converge to 98.0%, statistically indistinguishable from the 97.8% of standard binaries; a one-sided Wilcoxon test over 94 paired configurations gives p < 10^-10.
  • The filter is selective but not destructive: entailment improves in 59 of 94 configurations, is unchanged in the 32 that were already at 100%, and decreases in only 3, so requiring domain entailment removes spurious paths without discarding much useful output.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same alignment machinery could be pointed at source-level call graphs and at organizational security rules or coding standards instead of CWE classes; the authors name source-code analysis as future work, and nothing in the logic binds it to binaries.
  • If rejected paths are fed to a corrector that produces minimal-edit entailed alternatives — a module the authors list as planned — the reasoner would act as a teacher, letting the model internalize the domain vocabulary from its own concrete mistakes.
  • The appendix observes that unaided LLM entailment is ordered almost exactly like random sampling, hinting that permissiveness of the domain graph may shape baseline scores; a way to test this is to replace the DKG's relation edges with randomized ones and ask whether the +DK gain survives.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. EntailLLM proposes to verify LLM-generated analyst traversal paths through a binary's function call graph by checking entailment against a separate CWE-specific domain-knowledge graph in temporal annotated logic. The system consists of a Ghidra-based labeled call graph, prompt-based LLM path-template generation, beam-search realization, and a PyReason logical verifier using 42 hand-written rules and DKG graphs. The evaluation reports that adding domain knowledge to the generator (+DK) raises pooled entailment from 78.0% to 97.9% across four LLMs, three prompting strategies, and seven/eight binaries, with decreases in only 3 of 94 configurations; the effect is accompanied by a random baseline and stability runs. The paper also describes deployment on three medical-device firmware binaries. The main quantitative claim is confounded because +DK injects into the prompt the same derived DKG vocabulary that the verifier's traversal rules use to establish entailment.

Significance. If the 78→98% effect were attributable to the logical verification layer, the contribution would be significant: it would be a deployable, explainable mechanism for rejecting LLM-proposed vulnerability exploration paths, with formal generalized-annotated-logic semantics, exact polynomial-time deduction inherited from prior work, per-configuration tables, a random baseline showing LLM paths exceed chance, full prompt templates and logic rules in the appendix, and an open-source reasoner (PyReason). Those strengths are real and should be preserved. However, as it stands the headline comparison does not isolate the verifier's contribution. Entailment is defined relative to the authors' own DKG and rules, which are assumed correct, so high entailment is internal consistency, not validated vulnerability relevance. The paper is honest about this limitation. With additional controlled experiments and external validation, the framework could be a useful contribution; the current evidence is insufficient.

major comments (3)
  1. [Section 3 (Step 1), Appendix J.5, Appendix H.1] The +DK manipulation changes the generator rather than isolating the verifier. Appendix J.5 states that +DK appends to each label group the DKG concepts derived by running the mapping rules over that block's raw libc labels. The six traversal rules in Appendix H.1 then entail a step whenever hasLabel(CB1,Lc), hasLabel(CB2,Le), stepFrom(CB1,CB2), and any one of six relations connects Lc and Le. Consequently, if the LLM writes a stage using an injected concept such as missing_bounds_check, the reasoner will derive that same hasLabel fact from the block's raw labels (provided the mapping rule fires), and with DKG graphs of 232-403 relations plus transitive closure, most adjacent injected pairs will have some connecting relation. A path that reuses the injected vocabulary is therefore entailed almost by construction. The J.5 remark that injected labels are 'not entailment verdicts' is techni
  2. [Section 2, Section 3 (Domain Knowledge), Appendix K, Section 6] Entailment is a relation to the authors' own program: the 42 rules and the 105-188-entity DKG graphs are assumed correct and fixed, as stated in Section 3 and Appendix K. Thus a 98% entailment rate establishes that paths conform to the authors' model of CWE-121/415/416, not that they correspond to real vulnerability-relevant behavior. Since Section 6 states that only logical entailment is measured and that validated vulnerability labels for the device firmware are scarce, the paper cannot currently support the abstract's 'improves correctness' or the safety-critical motivation. A concrete test would be to compare entailed vs rejected paths against known CVEs in BinPool (e.g., the functions implicated in each CVE) or to have expert reverse engineers judge a sample; without such grounding, the headline metric is internal.
  3. [Section 4, Tables 3-4] The paired Wilcoxon test and the 'only 3 of 94 configurations decrease' claim treat per-configuration entailment percentages with no weighting by #Total. Several cells have one or two realized paths (e.g., Table 3, GPT-5.5 gpac zero-shot has 12 total but +DK 1/1; Llama-4 Scout gpac zero-shot has 5/1), and +DK often reduces #Total substantially (e.g., Kimi K2.5 insulininject zero-shot 158→11). A change from 0/1 to 1/1 contributes +100 percentage points, the same as a change from 90/100 to 100/100. The pooled percentages are more meaningful, but the per-configuration significance test should at least be accompanied by a denominator-aware analysis, and the '3/94' count should be reported with the distribution of #Total.
minor comments (4)
  1. [Figure 3 vs Appendix J.1] The constraints in Figure 3 say 'one label group per stage, no cross-group mixing', while the shared base prompt in Appendix J.1 says 'Labels can be mixed from different sets within the same stage.' Clarify which constraint was actually enforced; the discrepancy affects reproducibility.
  2. [Section 2] The entailment symbol is overloaded: Π |=_ent τ and I* |=_i analystAt(...) have different meanings. Define the second use explicitly.
  3. [Section 6 and Appendix B.2] The conclusion's self-refinement counts (1,054→1,445) do not match the sums of Tables 3-4 for the self-refinement rows, nor Appendix Table 2's per-type aggregates. Please reconcile the numbers.
  4. [Throughout] Minor language issues: 'contradicts with the domain knowledge' should be 'contradicts the domain knowledge'; 'utilizes that exploration into verified output' should be 'converts that exploration into verified output'.

Circularity Check

1 steps flagged · score 6.0 of 10

The +DK condition hands the LLM the verifier's own derived labels, so the headline 78→98% entailment gain is partly by construction; the paper's own Appendix B.1 shows the metric tracks DK permissiveness.

  1. fitted input called prediction [Section 3 (Domain Knowledge); Appendix J.5 (Domain-Knowledge Enrichment); Appendix H.1]
    "DK also supplies the mapping rules that lift raw libc labels onto its own vocabulary during reasoning, so the labels attached to code blocks are expressed in the terms against which paths are later checked for entailment. For the +DK experimental setting, we pre-run the mapping rules and provide the LLM with additional labels."

    The +DK prompt is built by running the same mapping rules that the verifier uses to derive hasLabel facts, and the traversal rule then 'entails' a step whenever a DK relation links a label on CB1 to a label on CB2. Any realized path that reuses the injected DK vocabulary therefore satisfies the verifier's hasLabel precondition by construction (assuming the DKG contains a relevant edge), so the 78→98% gain largely measures the LLM's echo of the supplied labels, not the reasoner's independent rejection of bad paths. The paper's own Appendix B.1 notes unaided entailment is ordered like random sampling and +DK collapses all binaries to ~91–100%, consistent with near-trivial entailment once the vocabulary is provided. No scrambled-label or post-hoc-only control separates prompt enrichment from

full rationale

EntailLLM's logical core is self-contained: given a fixed DKG and rule set, PyReason computes entailment exactly, and the random-sampling baseline shows the verifier is not vacuous (18–46% for random paths). The formal guarantees cited from Shakarian et al. are published theorems, not results fabricated for this paper. However, the headline 78→98% gain is measured under a +DK condition in which the LLM prompt is augmented with labels produced by the very mapping rules the verifier uses to define entailment. The paper states this openly (Section 3, Appendix J.5), and its own Appendix B.1 observes that unaided entailment tracks random sampling and that +DK makes all binaries converge to ~91–100%. Thus the independent contribution of the reasoner is not isolated: a control that injects scrambled labels, or that verifies baseline generations post hoc, is absent. The improvement is therefore partially by construction—the generator is handed the verifier's vocabulary—so the magnitude of the reported effect cannot be read as evidence that the logic layer catches erroneous paths. The paper also explicitly assumes the DK is accurate and reports no external ground-truth validation, which is a correctness/external-validity limitation rather than a circular step; it amplifies the concern because 98% entailment is conformance to the authors' own model. I find no additional circularity: the PyReason engine is open-source, the logic-program rules are stated in the appendix, and the complexity citations are to prior published work.

Assumptions & free parameters 3 free parameters · 4 assumptions · 1 invented entities

The central claimed improvement depends on the authors' hand-built DK graphs, hand-set rule thresholds, and the chosen N_sol parameter. The logic engine is standard, but the knowledge content is assumed correct without external validation.

free parameters (3)
  • mu_min (minimum admissible annotation bound) = [0.25, 1]
    Hand-set threshold for considering an analyst present at a block; gates the traversal rules and thus the entailment verdict.
  • N_sol (realized chains kept per surviving template) = 5
    Tuned over {1,2,5,10} on the evaluation set; smaller values degraded results and larger ones raised runtime/cost.
  • Rule annotation bounds (0.1, 0.25, 0.6, 0.7, etc.) = multiple hand-set values in 42 rules
    Hand-set thresholds in the logic program body clauses; they control which label combinations fire, affecting the measured entailment rate.
assumptions (4)
  • domain assumption The domain-knowledge graphs are accurate and complete for the target CWEs
    Stated explicitly: 'We assume the domain knowledge itself is accurate.' If false, high entailment does not reflect real vulnerability behavior.
  • domain assumption Ghidra's recovered call graph and libc labels are correct and sufficient
    The entire pipeline consumes Ghidra output as ground truth for structure and labels; no error model is provided.
  • standard math Generalized annotated logic semantics and polynomial-time fixpoint theorems (Kifer and Subrahmanian 1992; Shakarian et al. 2011)
    The formal guarantee of exact entailment relies on these prior results, cited but not proved in the paper.
  • ad hoc to paper The 42 hand-written rule templates correctly encode vulnerability reasoning
    The rules are authored for this system, not derived from a standard or externally validated source; their correctness is assumed.
invented entities (1)
  • Domain-knowledge graph concepts (e.g., missing_bounds_check, unchecked_memory_write, stack_pointer_overwrite)
    purpose: Bridge raw libc labels and CWE-level vulnerability classes so the entailment rules can justify analyst steps
    These concepts are constructed by the authors via automated extraction and manual review; they are assumed correct and not validated against external benchmarks.

how reviews work

0 comments
Cite this review

Pith. "Pith review of EntailLLM: Verifying LLM-Generated Vulnerability Discovery Paths with Domain Knowledge via Logic Programming." pith.science (2026). https://pith.science/paper/Y7UXWLAN

@misc{pith2026260801763,
  author       = {Pith},
  title        = {Pith review of: EntailLLM: Verifying LLM-Generated Vulnerability Discovery Paths with Domain Knowledge via Logic Programming},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Y7UXWLAN}},
  note         = {Machine review of arXiv:2608.01763}
}
read the original abstract

Large language models are increasingly used to reason about software vulnerabilities, but their outputs can silently violate domain knowledge, limiting their reliability in safety-critical settings such as medical devices. Prior work either treats that output as a prediction to be scored or constrains it to walks within a single knowledge graph; neither checks whether reasoning over a binary is consistent with an independent body of domain knowledge. We present EntailLLM, which validates each LLM-proposed analyst path by entailment: the path is a traversal of the binary's function call graph, the domain knowledge is represented in a separate graph, and verification aligns the two under temporal annotated logic. Across three CWE classes, four LLMs, three prompting strategies, and seven binaries varying in size from 405 to 12,696 function call-graph nodes, domain knowledge raises pooled entailment from 78% to 98%, with entailment decreasing in only 3% of the experiments. EntailLLM is deployed end-to-end on real medical-device binaries, reaching 98% pooled entailment without per-device tuning. Our system inherits the formal guarantees of generalized annotated logic, providing logical verification of LLM output that is both explainable and grounded in well-defined semantics.

Figures

Figures reproduced from arXiv: 2608.01763 by the authors.

Figure 1
Figure 1. An LLM mistake caught by domain knowledge. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The end-to-end EntailLLM pipeline. Solid boxes [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Structured prompt template for CWE-121. Full [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (11 more)
Figure 5
Figure 5. Figure 5: Plots showing how (a) reasoning time and (b) peak [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: The explainable trace showing entailment (first two, [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 1
Figure 1. Figure 1: Zero-shot on insulininject (CWE-121). Each box is ten independent runs: grey is random sampling, blue unaided generation, orange the same model with domain knowledge (+DK). Random sampling attains 18.0± 8.5% entailment. A box collapsed to a single line indicates zero v…
Figure 2
Figure 2. Figure 2: Chain-of-thought on insulininject (CWE-121). Conventions as in [PITH_FULL_IMAGE:figures/full_fig_p010_2.png]
Figure 3
Figure 3. Figure 3: Self-refinement on insulininject (CWE-121) [PITH_FULL_IMAGE:figures/full_fig_p011_3.png]
Figure 4
Figure 4. Figure 4: Zero-shot on mupdf-x11 (CWE-416). Conventions as in [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]
Figure 5
Figure 5. Figure 5: Chain-of-thought on mupdf-x11 (CWE-416). Conventions as in [PITH_FULL_IMAGE:figures/full_fig_p012_5.png]
Figure 6
Figure 6. Figure 6: Self-refinement on mupdf-x11 (CWE-416). Conventions as in [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 7
Figure 7. Figure 7: Reasoning runtime versus number of reasoning time steps for all CWE-121 (solid) and CWE-416 (dashed) [PITH_FULL_IMAGE:figures/full_fig_p016_7.png]
Figure 8
Figure 8. Figure 8: Peak resident set size (RSS) after reasoning versus number of reasoning time steps for all CWE-121 (solid) [PITH_FULL_IMAGE:figures/full_fig_p017_8.png]
Figure 9
Figure 9. Figure 9: The reasoning trace behind a non-entailment inference, for the analyst path of the running example in the [PITH_FULL_IMAGE:figures/full_fig_p026_9.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

299 extracted references · 63 canonical work pages

  1. [1]

    Artificial intelligence , volume=

    Circumscription—a form of non-monotonic reasoning , author=. Artificial intelligence , volume=. 1980 , publisher=

    1980

  2. [2]

    ACM Comput

    Sheng, Ze and Chen, Zhicheng and Gu, Shuning and Huang, Heqing and Gu, Guofei and Huang, Jeff , title =. ACM Comput. Surv. , month = nov, articleno =. 2025 , issue_date =. doi:10.1145/3769082 , abstract =

    doi:10.1145/3769082 2025

  3. [3]

    2024 IEEE symposium on security and privacy (SP) , pages=

    Llms cannot reliably identify and reason about security vulnerabilities (yet?): A comprehensive evaluation, framework, and benchmarks , author=. 2024 IEEE symposium on security and privacy (SP) , pages=. 2024 , organization=

    2024

  4. [4]

    Karonte: Detecting Insecure Multi-binary Interactions in Embedded Firmware , year=

    Redini, Nilo and Machiry, Aravind and Wang, Ruoyu and Spensky, Chad and Continella, Andrea and Shoshitaishvili, Yan and Kruegel, Christopher and Vigna, Giovanni , booktitle=. Karonte: Detecting Insecure Multi-binary Interactions in Embedded Firmware , year=

  5. [5]

    Logic- LM : Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning

    Pan, Liangming and Albalak, Alon and Wang, Xinyi and Wang, William. Logic- LM : Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning. Findings of the Association for Computational Linguistics: EMNLP 2023. 2023. doi:10.18653/v1/2023.findings-emnlp.248

    doi:10.18653/v1/2023.findings-emnlp.248 2023

  6. [6]

    Proceedings of the 33rd ACM international conference on information and knowledge management , pages=

    Realtcd: Temporal causal discovery from interventional data with large language model , author=. Proceedings of the 33rd ACM international conference on information and knowledge management , pages=

  7. [7]

    , author=

    Decompiling the Synergy: An Empirical Study of Human-LLM Teaming in Software Reverse Engineering. , author=. NDSS , year=

  8. [8]

    The temporal logic of programs , year=

    Pnueli, Amir , booktitle=. The temporal logic of programs , year=

Show all 299 references
  1. [9]

    Formal aspects of computing , volume=

    A logic for reasoning about time and reliability , author=. Formal aspects of computing , volume=. 1994 , publisher=

    1994

  2. [10]

    2005 , issn =

    Probabilistic temporal logics via the modal mu-calculus , journal =. 2005 , issn =. doi:https://doi.org/10.1016/j.tcs.2005.03.048 , url =

    2005 doi

  3. [11]

    arXiv preprint arXiv:2505.19361 , year=

    Consistency-based Abductive Reasoning over Perceptual Errors of Multiple Pre-trained Models in Novel Environments , author=. arXiv preprint arXiv:2505.19361 , year=

  4. [12]

    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE , volume=

    Geospatial Trajectory Generation via Efficient Abduction: Deployment for Independent Testing , author=. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE , volume=. 2025 , publisher=

    2025

  5. [13]

    arXiv preprint arXiv:2506.17776 , year=

    Machine Learning Model Integration with Open World Temporal Logic for Process Automation , author=. arXiv preprint arXiv:2506.17776 , year=

  6. [14]

    arXiv preprint arXiv:2507.10781 , year=

    Reasoning about Medical Triage Optimization with Logic Programming , author=. arXiv preprint arXiv:2507.10781 , year=

  7. [15]

    Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning , author=

  8. [16]

    Probabilistic circuits: A unifying framework for tractable probabilistic models , author=. UCLA. URL: http://starai. cs. ucla. edu/papers/ProbCirc20. pdf , pages=

  9. [17]

    ACM Transactions on Programming Languages and Systems (TOPLAS) , volume=

    Automatic verification of finite-state concurrent systems using temporal logic specifications , author=. ACM Transactions on Programming Languages and Systems (TOPLAS) , volume=. 1986 , publisher=

    1986

  10. [18]

    2012 , publisher=

    A new introduction to modal logic , author=. 2012 , publisher=

    2012

  11. [19]

    IEEE transactions on knowledge and data engineering , volume=

    What you always wanted to know about Datalog(and never dared to ask) , author=. IEEE transactions on knowledge and data engineering , volume=

  12. [20]

    2021 60th IEEE Conference on Decision and Control (CDC) , pages=

    Non-markovian reinforcement learning using fractional dynamics , author=. 2021 60th IEEE Conference on Decision and Control (CDC) , pages=. 2021 , organization=

    2021

  13. [21]

    arXiv preprint arXiv:2002.11002 , year=

    Turning 30: New ideas in inductive logic programming , author=. arXiv preprint arXiv:2002.11002 , year=

    2002 arXiv

  14. [22]

    Advances in Neural Information Processing Systems , volume=

    Bridging machine learning and logical reasoning by abductive learning , author=. Advances in Neural Information Processing Systems , volume=

  15. [23]

    Proceedings of the AAAI conference on artificial intelligence , volume=

    Reinforcement learning with non-markovian rewards , author=. Proceedings of the AAAI conference on artificial intelligence , volume=

  16. [24]

    Journal of Machine Learning Research , volume=

    Reinforcement learning for joint optimization of multiple rewards , author=. Journal of Machine Learning Research , volume=

  17. [25]

    Advances in neural information processing systems , volume=

    Reinforcement learning in Markovian and non-Markovian environments , author=. Advances in neural information processing systems , volume=

  18. [26]

    Systems & Control Letters , volume=

    Reinforcement learning in non-Markovian environments , author=. Systems & Control Letters , volume=. 2024 , publisher=

    2024

  19. [27]

    Advances in Neural Information Processing Systems , volume=

    Rethinking knowledge graph evaluation under the open-world assumption , author=. Advances in Neural Information Processing Systems , volume=

  20. [28]

    On Context and the Open World Assumption , year=

    Moore, Philip and Van Pham, Hai , booktitle=. On Context and the Open World Assumption , year=

  21. [29]

    AMIA annual symposium proceedings , volume=

    UMLS-Interface and UMLS-Similarity: open source software for measuring paths and semantic similarity , author=. AMIA annual symposium proceedings , volume=. 2009 , organization=

    2009

  22. [30]

    J. A. Robinson , doi =. Loveland Donald W.. Automated Theorem Proving. A Logical Basis. Fundamental Studies in Computer Science, Vol. 6. North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978, Xiii + 405 Pp , volume =. Journal of Symbolic Logic , number =

    1978

  23. [31]

    Temporal Equilibrium Logic: A First Approach

    Cabalar, Pedro and P \'e rez Vega, Gilberto. Temporal Equilibrium Logic: A First Approach. Computer Aided Systems Theory -- EUROCAST 2007. 2007

    2007

  24. [32]

    On the Complexity of Temporal Equilibrium Logic , year=

    Bozzelli, Laura and Pearce, David , booktitle=. On the Complexity of Temporal Equilibrium Logic , year=

  25. [33]

    Ai Magazine , volume=

    Applications of answer set programming , author=. Ai Magazine , volume=

  26. [34]

    , title =

    Kowalski, Robert A. , title =. Commun. ACM , month = jan, pages =. 1988 , issue_date =. doi:10.1145/35043.35046 , abstract =

    1988

  27. [35]

    Communications of the ACM , volume=

    Answer set programming at a glance , author=. Communications of the ACM , volume=. 2011 , publisher=

    2011

  28. [36]

    Annals of Mathematics and Artificial Intelligence , month = jun, pages =

    Pearce, David , title =. Annals of Mathematics and Artificial Intelligence , month = jun, pages =. 2006 , issue_date =. doi:10.1007/s10472-006-9028-z , abstract =

    2006 doi

  29. [37]

    and Kasneci, Gjergji and Weikum, Gerhard , title =

    Suchanek, Fabian M. and Kasneci, Gjergji and Weikum, Gerhard , title =. Proceedings of the 16th International Conference on World Wide Web , pages =. 2007 , isbn =. doi:10.1145/1242572.1242667 , abstract =

    2007

  30. [38]

    International Conference on Knowledge Engineering and Ontology Development , volume=

    Meaning-preserving skolemization , author=. International Conference on Knowledge Engineering and Ontology Development , volume=. 2011 , organization=

    2011

  31. [39]

    Answer set programming at a glance , year =

    Brewka, Gerhard and Eiter, Thomas and Truszczy\'. Answer set programming at a glance , year =. Commun. ACM , month = dec, pages =. doi:10.1145/2043174.2043195 , abstract =

  32. [40]

    The logic programming paradigm: A 25-year perspective , pages=

    Stable models and an alternative logic programming paradigm , author=. The logic programming paradigm: A 25-year perspective , pages=

  33. [41]

    The stable model semantics for logic programming , author=. Proc. 5'h International Conference and Symposium on Logic Programming , pages=

  34. [42]

    Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm , volume =

    Niemelä, Ilkka , year =. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm , volume =. Ann. Math. Artif. Intell. , doi =

  35. [43]

    Translating Embeddings for Modeling Multi-relational Data , url =

    Bordes, Antoine and Usunier, Nicolas and Garcia-Duran, Alberto and Weston, Jason and Yakhnenko, Oksana , booktitle =. Translating Embeddings for Modeling Multi-relational Data , url =

  36. [44]

    Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE : Design of a System with Support for Existential Quantification Using Skolemization

    Diller, Martin and Wyner, Adam and Strass, Hannes. Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE : Design of a System with Support for Existential Quantification Using Skolemization. Proceedings of the 13th International Conference on Co...

    2019 doi

  37. [45]

    Computing Meaning: Volume 1 , pages=

    Dynamic Skolemization , author=. Computing Meaning: Volume 1 , pages=. 1999 , publisher=

    1999

  38. [46]

    SIAM Review , volume=

    Symbolic Logic and Mechanical Theorem Proving (Chin-Liang Chang and Richard Char-Tung Lee) , author=. SIAM Review , volume=. 1974 , publisher=

    1974

  39. [47]

    New York , pages=

    Automated Theorem Proving: A Logical Basis North Holland , author=. New York , pages=

  40. [48]

    2012 , isbn =

    Ginsberg, Matt , title =. 2012 , isbn =

    2012

  41. [49]

    Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages=

    Mining for causal relationships: A data-driven study of the islamic state , author=. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages=

  42. [50]

    and Subrahmanian, V

    Paulo Shakarian and Simari, Gerardo I. and Subrahmanian, V. S. Annotated Probabilistic Temporal logic: Approximate fixpoint implementation. ACM Transactions on Computational Logic. 2012. doi:10.1145/2159531.2159535

    2012

  43. [51]

    and Subrahmanian, Venkatramana V

    Shakarian, Paulo and Parker, Austin and Simari, Gerardo I. and Subrahmanian, Venkatramana V. S. , title =. ACM Trans. Comput. Logic , month =. 2011 , issue_date =. doi:10.1145/1877714.1877720 , abstract =

    2011

  44. [52]

    Quo Vadis, Action Recognition?

    Jo. Quo Vadis, Action Recognition?. CoRR , volume =. 2017 , url =. 1705.07750 , timestamp =

    2017 arXiv

  45. [53]

    ImageNet Classification with Deep Convolutional Neural Networks , url =

    Krizhevsky, Alex and Sutskever, Ilya and Hinton, Geoffrey E , booktitle =. ImageNet Classification with Deep Convolutional Neural Networks , url =

  46. [54]

    CoRR , volume =

    Xinyu Fu and Jiani Zhang and Ziqiao Meng and Irwin King , title =. CoRR , volume =. 2020 , url =. 2002.01680 , timestamp =

    2020 arXiv

  47. [55]

    2022 , eprint=

    The Impact of Feature Quantity on Recommendation Algorithm Performance: A Movielens-100K Case Study , author=. 2022 , eprint=

    2022

  48. [56]

    A Novel Framework for Constructing Multimodal Knowledge Graph from MuSe-CaR Video Reviews , year=

    Usmani, Atiya and Alsamhi, Saeed Hamood and Breslin, John and Curry, Edward , booktitle=. A Novel Framework for Constructing Multimodal Knowledge Graph from MuSe-CaR Video Reviews , year=

  49. [57]

    XR4DRAMA Knowledge Graph: A Knowledge Graph for Disaster Management , year=

    Vassiliades, Alexandros and Symeonidis, Spyridon and Diplaris, Sotiris and Tzanetis, Georgios and Vrochidis, Stefanos and Bassiliades, Nick and Kompatsiaris, Ioannis , booktitle=. XR4DRAMA Knowledge Graph: A Knowledge Graph for Disaster Management , year=

  50. [58]

    Ontology Modeling for Probabilistic Knowledge Graphs , year=

    Freedman, Hayden and Abolhassani, Neda and Metzger, Jacob and Paul, Sanjoy , booktitle=. Ontology Modeling for Probabilistic Knowledge Graphs , year=

  51. [59]

    DocSemMap: Leveraging Textual Data Documentations for Mapping Structured Data Sets into Knowledge Graphs , year=

    Burgdorf, Andreas and Paulus, Alexander and Pomp, André and Meisen, Tobias , booktitle=. DocSemMap: Leveraging Textual Data Documentations for Mapping Structured Data Sets into Knowledge Graphs , year=

  52. [60]

    Subrahmanian , title =

    Michael Kifer and V.S. Subrahmanian , title =. J. Log. Program. , volume =. 1992 , pages =

    1992

  53. [61]

    arXiv preprint arXiv:2306.01439 , year=

    Interpretable and Explainable Logical Policies via Neurally Guided Symbolic Abstraction , author=. arXiv preprint arXiv:2306.01439 , year=

    arXiv

  54. [62]

    arXiv preprint arXiv:1708.04782 , year=

    Starcraft ii: A new challenge for reinforcement learning , author=. arXiv preprint arXiv:1708.04782 , year=

    arXiv

  55. [63]

    Proceedings of the international conference on scientific computing (CSC) , pages=

    Advanced framework for simulation, integration and modeling (AFSIM)(Case Number: 88ABW-2015-2258) , author=. Proceedings of the international conference on scientific computing (CSC) , pages=. 2015 , organization=

    2015

  56. [64]

    Proceedings of the AAAI conference on artificial intelligence , volume=

    Safe reinforcement learning via shielding , author=. Proceedings of the AAAI conference on artificial intelligence , volume=

  57. [65]

    Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems , pages=

    Safe Multi-Agent Reinforcement Learning via Shielding , author=. Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems , pages=

  58. [66]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Safe reinforcement learning via shielding under partial observability , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  59. [67]

    AAAI Spring Symposium: MAKE , year=

    PyReason: Software for Open World Temporal Logic , author=. AAAI Spring Symposium: MAKE , year=

  60. [68]

    hostile decision dynamics in MDO , author=

    Battlespace: using AI to understand friendly vs. hostile decision dynamics in MDO , author=. Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications III , volume=. 2021 , organization=

    2021

  61. [69]

    nature , volume=

    Human-level control through deep reinforcement learning , author=. nature , volume=. 2015 , publisher=

    2015

  62. [70]

    Alegre , title =

    Lucas N. Alegre , title =. GitHub repository , howpublished =. 2019 , publisher =

    2019

  63. [71]

    2019 , Eprint =

    Nestor Gonzalez Lopez and Yue Leire Erro Nuin and Elias Barba Moral and Lander Usategui San Juan and Alejandro Solano Rueda and Víctor Mayoral Vilches and Risto Kojcev , Title =. 2019 , Eprint =

    2019

  64. [72]

    arXiv preprint arXiv:1910.01708 , volume=

    Benchmarking safe exploration in deep reinforcement learning , author=. arXiv preprint arXiv:1910.01708 , volume=

    1910 arXiv

  65. [73]

    Workshop on Language and Robotics at CoRL 2022 , year=

    Lang2ltl: Translating natural language commands to temporal specification with large language models , author=. Workshop on Language and Robotics at CoRL 2022 , year=

    2022

  66. [74]

    Hybrid Machine Learning/Knowledge Base Systems Learning through Natural Language Dialogue with Deep Learning Models , author=

  67. [75]

    Physica D: Nonlinear Phenomena , author =

    The symbol grounding problem , volume =. Physica D: Nonlinear Phenomena , author =

  68. [76]

    Conference on Empirical Methods in Natural Language Processing , pages=

    Logical Neural Networks for Knowledge Base Completion with Embeddings & Rules , author=. Conference on Empirical Methods in Natural Language Processing , pages=

  69. [77]

    2021 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C) , pages=

    From conceptual models to knowledge graphs: a generic model transformation platform , author=. 2021 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C) , pages=. 2021 , organization=

    2021

  70. [78]

    , author=

    Fast discovery of association rules. , author=. Advances in knowledge discovery and data mining , volume=. 1996 , publisher=

    1996

  71. [79]

    Machine learning , volume=

    Learning logical definitions from relations , author=. Machine learning , volume=. 1990 , publisher=

    1990

  72. [80]

    Journal of Operations Management , volume=

    Unveiling the structure of supply networks: case studies in Honda, Acura, and DaimlerChrysler , author=. Journal of Operations Management , volume=. 2002 , publisher=

    2002

  73. [81]

    Enterprise Design, Operations, and Computing: 26th International Conference , pages=

    Model-based construction of enterprise architecture knowledge graphs , author=. Enterprise Design, Operations, and Computing: 26th International Conference , pages=. 2022 , organization=

    2022

  74. [82]

    Advances in Neural Information Processing Systems , publisher =

    Ma, Meiyi and Gao, Ji and Feng, Lu and Stankovic, John , year =. Advances in Neural Information Processing Systems , publisher =

  75. [83]

    Journal of Supply Chain Management , volume=

    A theory of the nexus supplier: A critical supplier from a network perspective , author=. Journal of Supply Chain Management , volume=. 2015 , publisher=

    2015

  76. [84]

    2008 , institution=

    Exploring network structure, dynamics, and function using NetworkX , author=. 2008 , institution=

    2008

  77. [85]

    Van Emden, M. H. and Kowalski, R. A. , title =. J. ACM , month =. 1976 , issue_date =

    1976

  78. [86]

    Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC , pages=

    Numba: A llvm-based python jit compiler , author=. Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC , pages=

  79. [87]

    International scientific conference and international workshop present day trends of innovations , year=

    Data analysis in public social networks , author=. International scientific conference and international workshop present day trends of innovations , year=

  80. [88]

    Journal of Mathematical Analysis and Applications , volume=

    On some logical connectives for fuzzy sets theory , author=. Journal of Mathematical Analysis and Applications , volume=. 1983 , publisher=

    1983

  81. [89]

    1990 , publisher=

    Bilattices in logic programming , author=. 1990 , publisher=

    1990

  82. [90]

    Fuzzy Sets and Systems , year=

    Probabilistic uniformization of fuzzy topologies , author=. Fuzzy Sets and Systems , year=

  83. [91]

    2017 , publisher=

    Ontology-based data access leveraging subjective reports , author=. 2017 , publisher=

    2017

  84. [92]

    1995 , publisher=

    Foundations of databases , author=. 1995 , publisher=

    1995

  85. [93]

    Under Review , volume=

    Combining existential rules with network diffusion processes for automated generation of hypotheses , author=. Under Review , volume=

  86. [94]

    Natural language processing and knowledge representation: Language for Knowledge and Knowledge for Language , year=

    Episodic Logic meets Little Red Riding Hood: A comprehensive, natural representation for language understanding , author=. Natural language processing and knowledge representation: Language for Knowledge and Knowledge for Language , year=

  87. [95]

    Logic Programming , volume=

    Prolog and infinite trees , author=. Logic Programming , volume=

  88. [96]

    AAAI Conference on Artificial Intelligence , year=

    Neuro-symbolic inductive logic programming with logical neural networks , author=. AAAI Conference on Artificial Intelligence , year=

  89. [97]

    Machine learning , volume=

    Fast relational learning using bottom clause propositionalization with artificial neural networks , author=. Machine learning , volume=. 2014 , publisher=

    2014

  90. [98]

    The Journal of Logic Programming , volume=

    Inductive logic programming: Theory and methods , author=. The Journal of Logic Programming , volume=. 1994 , publisher=

    1994

  91. [99]

    Fuzzy sets and systems , volume=

    Fuzzy logic programming , author=. Fuzzy sets and systems , volume=. 2001 , publisher=

    2001

  92. [100]

    Differentiable Inductive Logic Programming in High-Dimensional Space , doi =

    Purgał, Stanisław and Cerna, David and Kaliszyk, Cezary , year =. Differentiable Inductive Logic Programming in High-Dimensional Space , doi =

  93. [101]

    arXiv e-prints , pages=

    Neuro-Symbolic Artificial Intelligence: Current Trends , author=. arXiv e-prints , pages=

  94. [102]

    Artificial Intelligence , volume=

    Diffusion centrality: A paradigm to maximize spread in social networks , author=. Artificial Intelligence , volume=. 2016 , publisher=

    2016

  95. [103]

    IJCAI , volume=

    PRISM: a language for symbolic-statistical modeling , author=. IJCAI , volume=

  96. [104]

    ACM Computing Surveys (CSUR) , volume=

    Hierarchical reinforcement learning: A comprehensive survey , author=. ACM Computing Surveys (CSUR) , volume=. 2021 , publisher=

    2021

  97. [105]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , year=

    Transfer learning in deep reinforcement learning: A survey , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , year=

  98. [106]

    arXiv preprint arXiv:1509.02971 , year=

    Continuous control with deep reinforcement learning , author=. arXiv preprint arXiv:1509.02971 , year=

    arXiv

  99. [107]

    and Niranjan, Mahesan , year =

    Rummery, G. and Niranjan, Mahesan , year =. On-Line Q-Learning Using Connectionist Systems , journal =

  100. [108]

    arXiv preprint arXiv:1707.06347 , year=

    Proximal policy optimization algorithms , author=. arXiv preprint arXiv:1707.06347 , year=

    arXiv

  101. [109]

    International conference on machine learning , pages=

    Trust region policy optimization , author=. International conference on machine learning , pages=. 2015 , organization=

    2015

  102. [110]

    ACM Computing Surveys (CSUR) , volume=

    Reinforcement learning in healthcare: A survey , author=. ACM Computing Surveys (CSUR) , volume=. 2021 , publisher=

    2021

  103. [111]

    IEEE Transactions on Intelligent Transportation Systems , volume=

    Deep reinforcement learning for autonomous driving: A survey , author=. IEEE Transactions on Intelligent Transportation Systems , volume=. 2021 , publisher=

    2021

  104. [112]

    Science Robotics , volume =

    Steven Macenski and Tully Foote and Brian Gerkey and Chris Lalancette and William Woodall , title =. Science Robotics , volume =. 2022 , doi =

    2022

  105. [113]

    Journal of Artificial Intelligence Research , volume=

    Ontology reasoning with deep neural networks , author=. Journal of Artificial Intelligence Research , volume=

  106. [114]

    Semantic Web , volume=

    A reasonable semantic web , author=. Semantic Web , volume=

  107. [115]

    Applied Intelligence , volume=

    Towards bridging the neuro-symbolic gap: deep deductive reasoners , author=. Applied Intelligence , volume=. 2021 , publisher=

    2021

  108. [116]

    Implementations of Prolog , year=

    Epilog: A Language for Extended Programming in Logic , author=. Implementations of Prolog , year=

  109. [117]

    arXiv preprint arXiv:2201.10816 , year=

    50 Years of Prolog and Beyond , author=. arXiv preprint arXiv:2201.10816 , year=

    arXiv

  110. [118]

    2021 , author =

    Detecting malicious behavior in social platforms via hybrid knowledge- and data-driven systems , journal =. 2021 , author =

    2021

  111. [119]

    and Molinaro, Christian , year =

    Shakarian, Paulo and Broecheler, Matthias and Subrahmanian, V.S. and Molinaro, Christian , year =. Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems , volume =

  112. [120]

    CoRR , volume =

    Gary Marcus , title =. CoRR , volume =. 2018 , url =. 1801.00631 , timestamp =

    2018 arXiv

  113. [121]

    2022 , copyright =

    Hamilton, Kyle and Nayak, Aparna and Božic, Bojan and Longo, Luca , title =. 2022 , copyright =. doi:10.48550/ARXIV.2202.12205 , url =

    2022 doi arXiv

  114. [122]

    AAAI conference on Artificial Intelligence , author=

    Neuro-Symbolic Inductive Logic Programming with Logical Neural Networks , number=. AAAI conference on Artificial Intelligence , author=

  115. [123]

    ArXivorg , author =

    NeuPSL: Neural Probabilistic Soft Logic , url =. ArXivorg , author =

  116. [124]

    International Joint Conference on Artificial Intelligence,

    NeurASP: Embracing Neural Networks into Answer Set Programming , author =. International Joint Conference on Artificial Intelligence,

  117. [125]

    Binarized Neural Networks , booktitle =

    Itay Hubara and Matthieu Courbariaux and Daniel Soudry and Ran El. Binarized Neural Networks , booktitle =. 2016 , timestamp =

    2016

  118. [126]

    Logic for Knowledge Representation, Learning, and Inference , author=

  119. [127]

    Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

    Deep residual learning for image recognition , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

  120. [128]

    Advances in Neural Information Processing Systems , year=

    Attention is all you need , author=. Advances in Neural Information Processing Systems , year=

  121. [129]

    International Symposium on Leveraging Applications of Formal Methods , pages=

    Logic-based explainability: past, present and future , author=. International Symposium on Leveraging Applications of Formal Methods , pages=. 2024 , organization=

    2024

  122. [130]

    The VLDB Journal , volume=

    Anytime bottom-up rule learning for large-scale knowledge graph completion , author=. The VLDB Journal , volume=. 2024 , publisher=

    2024

  123. [131]

    2024 IEEE 18th International Conference on Semantic Computing (ICSC) , pages=

    Scalable Semantic Non-Markovian Simulation Proxy for Reinforcement Learning , author=. 2024 IEEE 18th International Conference on Semantic Computing (ICSC) , pages=. 2024 , organization=

    2024

  124. [132]

    Catalogue of Artificial Intelligence Tools , pages=

    Skolemization , author=. Catalogue of Artificial Intelligence Tools , pages=. 1984 , publisher=

    1984

  125. [133]

    SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver , booktitle =

    Po. SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver , booktitle =. 2019 , url =

    2019

  126. [134]

    ICLR , year=

    Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients , author=. ICLR , year=

  127. [135]

    Simari and Robert Schroeder , title =

    Paulo Shakarian and Gerardo I. Simari and Robert Schroeder , title =. International conference on Autonomous Agents and Multi-Agent Systems,

  128. [136]

    Hikaru Shindo and Masaaki Nishino and Akihiro Yamamoto , title =

  129. [137]

    , author=

    Temporal Probabilistic Logic Programs. , author=. ICLP , volume=

  130. [138]

    2017 , pages =

    Hinge-Loss Markov Random Fields and Probabilistic Soft Logic , journal =. 2017 , pages =

    2017

  131. [139]

    2020 , url =

    Ali Payani , title =. 2020 , url =

    2020

  132. [140]

    25th International Conference on Inductive Logic Programming (ILP 2015) , year=

    Inductive logic programming using a maxsat solver , author=. 25th International Conference on Inductive Logic Programming (ILP 2015) , year=

    2015

  133. [141]

    Evans, Richard and Grefenstette, Edward , title =. J. Artif. Int. Res. , month =. 2018 , issue_date =

    2018

  134. [142]

    Andrew Stanton and Amanda Thart and Ashish Jain and Priyank Vyas and Arpan Chatterjee and Paulo Shakarian , title =

  135. [143]

    Simari and Devon Callahan , title =

    Paulo Shakarian and Gerardo I. Simari and Devon Callahan , title =. Theory Pract. Log. Program. , volume =

  136. [144]

    Riegel, Ryan and Gray, Alexander and Luus, Francois and Khan, Naweed and Makondo, Ndivhuwo and Akhalwaya, Ismail Yunus and Qian, Haifeng and Fagin, Ronald and Barahona, Francisco and Sharma, Udit and Ikbal, Shajith and Karanam, Hima and Neelam, Sumit and Likhyani, Ankita and S...

  137. [145]

    Logic Tensor Networks , journal =

    Samy Badreddine and Artur. Logic Tensor Networks , journal =. 2022 , issn =

    2022

  138. [146]

    and Subrahmanian, V

    Dekhtyar, Alex and Dekhtyar, Michael I. and Subrahmanian, V. S. , title =. 1999 , booktitle =

    1999

  139. [147]

    Analyzing Differentiable Fuzzy Logic Operators , journal =

    Emile. Analyzing Differentiable Fuzzy Logic Operators , journal =. 2022 , issn =

    2022

  140. [148]

    V. S. Subrahmanian and Diego Reforgiato Recupero , title=. IEEE Intelligent Systems , year=

  141. [149]

    Subrahmanian ,title =

    Matthias Broecheler and Paulo Shakarian and V.S. Subrahmanian ,title =. Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust, 2010 IEEE International Conference on ,volume =. 2010 ,pages =. doi:http://doi.ieeecomputersociety.org/10.1109/SocialC...

    2010 doi

  142. [150]

    Proceedings of the 19th international conference on World wide web , series =

    Leskovec, Jure and Huttenlocher, Daniel and Kleinberg, Jon , title =. Proceedings of the 19th international conference on World wide web , series =. 2010 , isbn =

    2010

  143. [151]

    Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , series =

    Chen, Wei and Wang, Chi and Wang, Yajun , title =. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , series =. 2010 , isbn =

    2010

  144. [152]

    Subrahmanian and Maria Luisa Sapino , title =

    Paulo Shakarian and V.S. Subrahmanian and Maria Luisa Sapino , title =. Technical Communications of the 26th International Conference on Logic Programming , pages =. 2010 , volume =

    2010

  145. [153]

    Gummadi , title =

    Meeyoung Cha and Alan Mislove and Krishna P. Gummadi , title =. In Proceedings of the 18th International World Wide Web Conference (WWW'09) , month =. 2009 , address =

    2009

  146. [154]

    , title =

    Kautz, Henry A. , title =. AI Magazine , volume =

  147. [155]

    Neurosymbolic

    Artur d'Avila Garcez and Lu. Neurosymbolic. CoRR , volume =

  148. [156]

    , title =

    Yi, Kexin and Wu, Jiajun and Gan, Chuang and Torralba, Antonio and Kohli, Pushmeet and Tenenbaum, Joshua B. , title =. 2018 , publisher =

    2018

  149. [157]

    2020 , publisher =

    Li, Qing and Siyuan Huang, Siyuan and Hong, Yining and Chen, Yixin and Wu, Ying Nian and Zhu, Song-Chun , title =. 2020 , publisher =

    2020

  150. [158]

    and Guillaume, J.L

    Blondel, V.D. and Guillaume, J.L. and Lambiotte, R. and Lefebvre, E. , journal=. 2008 , publisher=

    2008

  151. [159]

    Hochbaum , title=

    Dorit S. Hochbaum , title=

  152. [160]

    KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , year =

    Leskovec, Jure and Krause, Andreas and Guestrin, Carlos and Faloutsos, Christos and VanBriesen, Jeanne and Glance, Natalie , title =. KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , year =. doi:http://doi.acm.org/10...

  153. [161]

    2009 , month =

    Gesundheit! Modeling Contagion through Facebook News Feed , booktitle =. 2009 , month =

    2009

  154. [162]

    , title =

    Cha, Meeyoung and Mislove, Alan and Adams, Ben and Gummadi, Krishna P. , title =. WOSP '08: Proceedings of the first workshop on Online social networks , year =. doi:http://doi.acm.org/10.1145/1397735.1397739 , publisher =

  155. [163]

    and Peretti, J

    Watts, D.J. and Peretti, J. , title=. Harvard Business Review , month =

  156. [164]

    Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks , volume =

    Aral, Sinan and Muchnik, Lev and Sundararajan, Arun , citeulike-article-id =. Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks , volume =. Proceedings of the National Academy of Sciences , keywords =

  157. [165]

    , title =

    Goundan, P.R., and Schultz, A.S. , title =

  158. [166]

    L., and Wolsey, L

    Nemhauser, G. L., and Wolsey, L. A., and Fisher, M.L. , title =. Mathematical Programming , volume =. 1978 , pages =

    1978

  159. [167]

    Feige, Uriel , title =. J. ACM , volume =. 1998 , issn =. doi:http://doi.acm.org/10.1145/285055.285059 , publisher =

    1998

  160. [168]

    Hethcote

    Herbert W. Hethcote. Qualitative analyses of communicable disease models. Mathematical Biosciences. 1976

    1976

  161. [169]

    Network structure and the diffusion of knowledge

    Robin Cowan and Nicolas Jonard. Network structure and the diffusion of knowledge. Journal of Economic Dynamics and Control. 2004

    2004

  162. [170]

    The American Journal of Sociology , volume =

    Networks, Dynamics, and the Small-World Phenomenon , author =. The American Journal of Sociology , volume =. 1999 , publisher =

    1999

  163. [171]

    Evolutionary Dynamics on Small-World Networks , journal =

    Jan Rycht\'. Evolutionary Dynamics on Small-World Networks , journal =

  164. [172]

    Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing , pages=

    Llm4decompile: Decompiling binary code with large language models , author=. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing , pages=

    2024

  165. [173]

    Frontiers in Digital Health , volume =

    Menon, Vidya , title =. Frontiers in Digital Health , volume =. 2026 , doi =

    2026

  166. [174]

    2022 , note =

    Das, Aveek , title =. 2022 , note =

    2022

  167. [175]

    Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security , pages=

    Resym: Harnessing llms to recover variable and data structure symbols from stripped binaries , author=. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security , pages=

    2024

  168. [176]

    Proceedings of the 33rd ACM International Conference on the Foundations of Software Engineering (FSE Companion) , year =

    Arasteh, Sima and Nikitopoulos, Georgios and Wu, Wei-Cheng and Weideman, Nicolaas and Portnoy, Aaron and Raghothaman, Mukund and Hauser, Christophe , title =. Proceedings of the 33rd ACM International Conference on the Foundations of Software Engineering (FSE Companion) , year =

  169. [177]

    arXiv preprint arXiv:2509.02958 , year=

    Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning , author=. arXiv preprint arXiv:2509.02958 , year=

    arXiv

  170. [178]

    , author=

    DeGPT: Optimizing Decompiler Output with LLM. , author=. NDSS , year=

  171. [179]

    ACM Transactions on Software Engineering and Methodology , volume=

    Llm-powered static binary taint analysis , author=. ACM Transactions on Software Engineering and Methodology , volume=. 2025 , publisher=

    2025

  172. [180]

    arXiv preprint arXiv:2410.13080 , year=

    Graph-constrained reasoning: Faithful reasoning on knowledge graphs with large language models , author=. arXiv preprint arXiv:2410.13080 , year=

    arXiv

  173. [181]

    International Conference on Learning Representations , volume=

    Reasoning on graphs: Faithful and interpretable large language model reasoning , author=. International Conference on Learning Representations , volume=

  174. [182]

    34th USENIX Security Symposium (USENIX Security 25) , pages=

    \ LLMxCPG \ : \ Context-Aware \ vulnerability detection through code property \ Graph-Guided \ large language models , author=. 34th USENIX Security Symposium (USENIX Security 25) , pages=

  175. [183]

    Gottlob, Georg and Marcus, Sherry and Nerode, Anil and Salzer, Gernot and Subrahmanian, V. S. , title =. Theor. Comput. Sci. , volume =. 1996 , issn =. doi:http://dx.doi.org/10.1016/0304-3975(95)00207-3 , publisher =

    1996 doi

  176. [184]

    The Journal of Defense Modeling and Simulation , volume=

    Modeling information flow for an autonomous agent to support reverse engineering work , author=. The Journal of Defense Modeling and Simulation , volume=. 2017 , publisher=

    2017

  177. [185]

    Journal of Information Assurance and Security , volume=

    Software reverse engineering as a sensemaking task , author=. Journal of Information Assurance and Security , volume=

  178. [186]

    Stroe, Bogdan and Subrahmanian, V. S. , title =. AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems , year =. doi:http://doi.acm.org/10.1145/860575.860610 , publisher =

  179. [187]

    , citeulike-article-id =

    Lloyd, John W. , citeulike-article-id =. Foundations of logic programming , year =

  180. [188]

    29th USENIX Security Symposium (USENIX Security 20) , pages=

    An observational investigation of reverse \ Engineers’ \ processes , author=. 29th USENIX Security Symposium (USENIX Security 20) , pages=

  181. [189]

    Threshold Models of Collective Behavior , volume =

    Granovetter, Mark , issn =. Threshold Models of Collective Behavior , volume =. The American Journal of Sociology , keywords =

  182. [190]

    Schelling , title=

    Thomas C. Schelling , title=

  183. [191]

    Moran,P. A. P. , title =. Mathematical Proceedings of the Cambridge Philosophical Society , volume =

  184. [192]

    Nature , author =

    Evolutionary dynamics on graphs , volume =. Nature , author =. 2005 , pages =

    2005

  185. [193]

    Goldenberg, B

    J. Goldenberg, B. Libai, E. Muller , title=. Marketing Letters , volume = 12, number =3, year =2001, pages =

    2001

  186. [194]

    and May, Robert M

    Anderson, Roy M. and May, Robert M. , title=. Nature , volume = 280, number =5721, year =1979, pages =

    1979

  187. [195]

    and Codeco, C

    Coelho, F.C. and Codeco, C. and Cruz, H. , title =. Source Code for Biology and Medicin , volume=

  188. [196]

    Eagle, A

    N. Eagle, A. Pentland and D. Lazer , title =. Proc. 2008 Intl. Conference on Social and Behavioral Computing , publisher =

    2008

  189. [197]

    The Knowledge Engineering Review , volume =

    Van Hentenryck,Pascal , title =. The Knowledge Engineering Review , volume =

  190. [198]

    Falaschi, G

    M. Falaschi, G. Levi, A. Martelli and C. Palamidessi , title =. Proc. 5th Internat. Conf. Symp. on Logic Programming , editors =. 1988 , pages =

    1988

  191. [199]

    Eiter and J

    T. Eiter and J. Lu and V.S. Subrahmanian , title =. Proc. Intl. Conf. on Logic Programming and Non-Monotonic Reasoning , publisher =. 1997 , pages =

    1997

  192. [200]

    Damasio and L

    C. Damasio and L. Pereira and T. Swift , title =. Proc. Intl. Conf. on Logic Programming and Non-Monotonic Reasoning , publisher =

  193. [201]

    Venneksn and S

    J. Venneksn and S. Verbaeten and M. Bruynooghe , title =. Proc. Intl. Conf. on Logic Programming , publisher =. 2004 , pages =

    2004

  194. [202]

    A comparison of fuzzy and annotated logic programming

    Stanislav Krajci and Rastislav Lencses and Peter Vojt?s. A comparison of fuzzy and annotated logic programming. Fuzzy Sets and Systems. 2004

    2004

  195. [203]

    Lu , title =

    J. Lu , title =. Journal of Logic and Computation , year =

  196. [204]

    Multiple-Valued Logic, 1993., Proceedings of The Twenty-Third International Symposium on , year=

    Signed formulas and annotated logics , author=. Multiple-Valued Logic, 1993., Proceedings of The Twenty-Third International Symposium on , year=. doi:10.1109/ISMVL.1993.289582 , ISSN=

    1993

  197. [205]

    Jackson and L

    M. Jackson and L. Yariv , title =. Economie Publique , volume=

  198. [206]

    Maximizing the spread of influence through a social network , booktitle =

    Kempe, David and Kleinberg, Jon and Tardos, \'. Maximizing the spread of influence through a social network , booktitle =. 2003 , isbn =. doi:http://doi.acm.org/10.1145/956750.956769 , publisher =

    2003

  199. [207]

    Kifer and E

    M. Kifer and E. L. Lozinskii , title =. J. Autom. Reasoning , volume =

  200. [208]

    Thirunarayan and M

    K. Thirunarayan and M. Kifer , title =. Artificial Intelligence , volume =

  201. [209]

    Subrahmanian , title =

    Nicola Leone and Francesco Scarcello and V.S. Subrahmanian , title =. IEEE Transactions on Knowledge and Data Engineering , volume =. 2004 , pages =. doi:http://doi.ieeecomputersociety.org/10.1109/TKDE.2004.1269672 , publisher =

    2004 arXiv

  202. [210]

    and Nemhauser, George L

    Wolsey, Laurence A. and Nemhauser, George L. , citeulike-article-id =. Integer and Combinatorial Optimization

  203. [211]

    ILOG CPLEX Website, http://www.ilog.com/products/cplex/

    ILOG. ILOG CPLEX Website, http://www.ilog.com/products/cplex/

  204. [213]

    Shakarian, Paulo and Subrahmanian, V.S., and Sapino, Maria Luisa , title="

  205. [214]

    Dubois and H

    D. Dubois and H. Prade , title =. Proc. IPMU-1992 , publisher=

    1992

  206. [215]

    The Design and Analysis of Algorithms

    Dexter Kozen. The Design and Analysis of Algorithms. 1991

    1991

  207. [216]

    Artificial Intelligence , year =

    Dan Roth , title =. Artificial Intelligence , year =

  208. [217]

    ACM Transactions on Computational Logic (TOCL) , volume=

    Annotated probabilistic temporal logic: Approximate fixpoint implementation , author=. ACM Transactions on Computational Logic (TOCL) , volume=. 2012 , publisher=

    2012

  209. [218]

    V. S. Subrahmanian , title =. roceedings of the 4. IEEE Symposium on Logic Programming , year =

  210. [219]

    H. A. Blair and V.S.Subrahmanian , title =. Theor. Comput. Sci. , volume =. 1989 , pages =

    1989

  211. [220]

    H. A. Blair and V.S.Subrahmanian , title =. Journal of Non-Classical Logic , volume =. 1988 , pages =

    1988

  212. [221]

    Kifer and A

    M. Kifer and A. Li , title =. Lecture notes in computer science, ICDT '88 , year =

  213. [222]

    Annotated Constraint Logic Programming Applied to Temporal Reasoning

    Thom Fr. Annotated Constraint Logic Programming Applied to Temporal Reasoning. PLILP : Programming Language Implementation and Logic Programming. 1994

    1994

  214. [223]

    Temporal Annotated Constraint Logic Programming with Multiple Theories , booktitle =

    Paolo Mancarella and Alessandra Raffaet\`. Temporal Annotated Constraint Logic Programming with Multiple Theories , booktitle =

  215. [224]

    Carbogim and Fl\'

    Daniela V. Carbogim and Fl\'. Annotated Logic Applications for Imperfect Information , journal =. 1998 , pages =

    1998

  216. [225]

    A comparison of fuzzy and annotated logic programming , journal =

    Stanislav Krajci and Rastislav Lencses and Peter Vojt. A comparison of fuzzy and annotated logic programming , journal =. 2004 , pages =

    2004

  217. [226]

    Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets , booktitle =

    Pablo Barcel. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets , booktitle =. 2001 , pages =

    2001

  218. [227]

    IEEE International Conference on Systems, Man and Cybernetics , year =

    Krishnaprasad Thirunarayan , title =. IEEE International Conference on Systems, Man and Cybernetics , year =

  219. [228]

    Krishnaprasad Thirunarayan and Michael Kifer , title =. Proc. of IJCAI-89 , year =

  220. [229]

    International Journal of Reasoning-based Intelligent Systems , volume =

    Nakamatsu, Kazumi and Abe Jair Minoro , title =. International Journal of Reasoning-based Intelligent Systems , volume =. 2009 , pages =

    2009

  221. [230]

    Leach and James J

    Sonia M. Leach and James J. Lu , title =. Journal of Intelligent Information Systems, Springer , volume =

  222. [231]

    Drezner , title =

    A. Drezner , title =. Journal of Operational Research Society , volume =

  223. [232]

    , title="

    Stollsteimer, John F. , title=". 1963 , month=

    1963

  224. [233]

    Statistics

    Freedman, David, and Purves, Roger, and Pisani, Robert , howpublished =. Statistics

  225. [234]

    Marisa Cochrane , title="

  226. [235]

    US News and World Report , year =

    Alex Kingsbury , title = ". US News and World Report , year =

  227. [236]

    The New Yorker , year =

    Jon Lee Anderson , title = ". The New Yorker , year =

  228. [237]

    National Review , year =

    Rich Lowry , title = ". National Review , year =

  229. [238]

    2007 , type =

    Vali Nasr , title = ". 2007 , type =

    2007

  230. [239]

    Kagan, Frederick, and Kagan, Kimberly, and Pletka, Danielle , title="

  231. [240]

    Brown , title = "

    Ross A. Brown , title = ". Military Review , year =

  232. [241]

    Military Review , year =

    John Moulton , title = ". Military Review , year =

  233. [242]

    Mansoor and Mark S

    Peter R. Mansoor and Mark S. Ulrich , title = ". Military Review , year =

  234. [243]

    Military Review , year =

    Montgomery McFate , title = ". Military Review , year =

  235. [244]

    Parameters , year =

    Brian Reed , title = ". Parameters , year =

  236. [245]

    Unpublished Manuscript , year=

    Shakarian, Paulo and Subrahmanian, V.S., and Sapino, Maria Luisa , title=". Unpublished Manuscript , year=

  237. [246]

    , title = "

    Peirce, Charles S. , title = ". 1955 , type =

    1955

  238. [247]

    37", pages=

    Kariv, O. and Hakimi, S.L. An Algorithm Approach to Network Location Problems II . T he p-medians. SIAM Journal of Applied Mathematics , volume="37", pages="539-560", year=

  239. [248]

    37", pages=

    Kariv, O. and Hakimi, S.L. An Algorithm Approach to Network Location Problems I . T he p-centers. SIAM Journal of Applied Mathematics , volume="37", pages="513-538", year=

  240. [249]

    , title = "

    Slater, Peter J. , title = ". J. ACM , volume =. 1976 , issn =. doi:http://doi.acm.org/10.1145/321958.321964 , publisher =

    1976

  241. [250]

    Papadimitriou , title = "

    Christos H. Papadimitriou , title = ". SIAM J. Comput. , volume =. 1981 , pages =

    1981

  242. [251]

    and Tarjan, Robert E

    Fredman, Michael L. and Tarjan, Robert E. , citeulike-article-id =. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM , keywords =. doi:10.1145/28869.28874 , issn =

  243. [252]

    , title = "

    Karmarkar,, N. , title = ". Combinatorica , volume =. 1984 , issn =. doi:http://dx.doi.org/10.1007/BF02579150 , publisher =

    1984 doi

  244. [253]

    ACM Trans

    Alon, Noga and Moshkovitz, Dana and Safra, Shmuel , title = ". ACM Trans. Algorithms , volume =. 2006 , issn =. doi:http://doi.acm.org/10.1145/1150334.1150336 , publisher =

    2006

  245. [254]

    Aravind Srinivasan , title = ". SIAM J. Comput , year =

  246. [255]

    , citeulike-article-id =

    Hochbaum, Dorit S. , citeulike-article-id =. Approximation Algorithms for the Set Covering and Vertex Cover Problems. SIAM Journal on Computing , number =

  247. [256]

    , citeulike-article-id =

    Vazirani, Vijay V. , citeulike-article-id =. Approximation Algorithms

  248. [257]

    Tanner and John R

    Tom Bylander and Dean Allemang and Michael C. Tanner and John R. Josephson , title = "

  249. [258]

    ISAAC '08: Proceedings of the 19th International Symposium on Algorithms and Computation , year =

    Glasser, Christian and Reitwiessner, Christian and Schmitz, Heinz , title = ". ISAAC '08: Proceedings of the 19th International Symposium on Algorithms and Computation , year =. doi:http://dx.doi.org/10.1007/978-3-540-92182-0_7 , publisher =

    doi

  250. [259]

    Marathe and H

    M.V. Marathe and H. Breu and H. B. Hunt Iii and S. S. Ravi and D. J. Rosenkrantz , title =. Networks , year =

  251. [260]

    Annals of Mathematics and Arti Intelligence , year =

    Adam Cannon and Lenore Cowen , title =. Annals of Mathematics and Arti Intelligence , year =

  252. [261]

    doi:10.1007/s10878-009-9216-y , journal =

    Liao, Chen and Hu, Shiyan , citeulike-article-id =. doi:10.1007/s10878-009-9216-y , journal =

    doi

  253. [262]

    and Maass, Wolfgang , title =

    Hochbaum, Dorit S. and Maass, Wolfgang , title =. J. Algorithms , volume =. 1987 , issn =. doi:http://dx.doi.org/10.1016/0196-6774(87)90012-5 , publisher =

    1987 doi

  254. [263]

    Maass, Wolfgang , title =. SIAM J. Comput. , volume =. 1986 , issn =. doi:http://dx.doi.org/10.1137/0215031 , publisher =

    1986 doi

  255. [264]

    Sussmann , title =

    Samir Khuller and Yoram J. Sussmann , title =. In Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1136 , year =

  256. [265]

    Shmoys and Eva Tardos and Karen Aardal , title =

    David B. Shmoys and Eva Tardos and Karen Aardal , title =. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing , year =

  257. [266]

    Mount and Giri Narasimhan , title =

    Moses Charikar and Samir Khuller and David M. Mount and Giri Narasimhan , title =. IN PROCEEDINGS OF THE 12TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS , year =

  258. [267]

    and Komlos, Janos and Szemeredi, Endre , title =

    Fredman, Michael L. and Komlos, Janos and Szemeredi, Endre , title =. SFCS '82: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science , year =. doi:http://dx.doi.org/10.1109/SFCS.1982.89 , publisher =

    1982 doi

  259. [268]

    Proceedings of the IASTED international conference on parallel and distributed computing and systems (IASTED PDCS) , year =

    Xiao B, Zhuge Q, Zhang Y, Sha EH-M , title =. Proceedings of the IASTED international conference on parallel and distributed computing and systems (IASTED PDCS) , year =

  260. [269]

    AAIM '07: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management , year =

    Fu, Bin and Chen, Zhixiang and Abdelguerfi, Mahdi , title =. AAIM '07: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management , year =. doi:http://dx.doi.org/10.1007/978-3-540-72870-2_30 , publisher =

    doi

  261. [270]

    IEEE Transactions on Computers , volume =

    Massimo Franceschetti and Matthew Cook and Jehoshua Bruck , title =. IEEE Transactions on Computers , volume =. 2004 , pages =. doi:http://doi.ieeecomputersociety.org/10.1109/TC.2004.1268406 , publisher =

    2004 arXiv

  262. [271]

    Massimo Franceschetti and Matthew Cook and Jehoshua Bruck , title =

  263. [272]

    Optimal algorithms for approximate clustering , booktitle =

    Feder, Tom\'. Optimal algorithms for approximate clustering , booktitle =. 1988 , isbn =. doi:http://doi.acm.org/10.1145/62212.62255 , publisher =

    1988

  264. [273]

    Goodrich , title =

    Herv? Br?nnimann and Michael T. Goodrich , title =. Discrete Comput. Geom , year =

  265. [274]

    Gonzalez , title =

    Teofilo F. Gonzalez , title =. Inf. Process. Lett. , volume =. 1991 , pages =

    1991

  266. [275]

    , title =

    Baker, Brenda S. , title =. SFCS '83: Proceedings of the 24th Annual Symposium on Foundations of Computer Science , year =. doi:http://dx.doi.org/10.1109/SFCS.1983.7 , publisher =

    1983 doi

  267. [276]

    Hochbaum and Wolfgang Maass , title =

    Dorit S. Hochbaum and Wolfgang Maass , title =. J. ACM , year =

  268. [277]

    Lund, Carsten and Yannakakis, Mihalis , title =. J. ACM , volume =. 1994 , issn =. doi:http://doi.acm.org/10.1145/185675.306789 , publisher =

    1994

  269. [278]

    Agarwal and Micha Sharir , title =

    Pankaj K. Agarwal and Micha Sharir , title =. ACM Comput. Surv , year =

  270. [279]

    Sanjeev Arora and Prabhakar Raghavan and Satish Rao , title =. In Proc. 30th Annu. ACM Sympos. Theory Comput , year =

  271. [280]

    and Rao, Satish , title =

    Kolliopoulos, Stavros G. and Rao, Satish , title =. SIAM J. Comput. , volume =. 2007 , issn =. doi:http://dx.doi.org/10.1137/S0097539702404055 , publisher =

    2007 doi

  272. [281]

    The Journal of the Operational Research Society , jstor_issuetitle =

    An Indirect Genetic Algorithm for Set Covering Problems , author =. The Journal of the Operational Research Society , jstor_issuetitle =. 2002 , publisher =

    2002

  273. [282]

    Beasley, J. E. and Chu, P. C. , title=". European Journal of Operational Research , year=1996, volume=

    1996

  274. [283]

    Fabian Kuhn and Roger Wattenhofer , title =. In Proc. of the 22 nd ACM Symposium on the Principles of Distributed Computing (PODC , year =

  275. [284]

    Jia, Lujun and Rajaraman, Rajmohan and Suel, Torsten , title =. Distrib. Comput. , volume =. 2002 , issn =. doi:http://dx.doi.org/10.1017/s00446-002-0078-0 , publisher =

    2002 doi

  276. [285]

    Supowit , title =

    Nimrod Megiddo and Kenneth J. Supowit , title =. SIAM Journal of Computing , volume =. 1984 , pages =

    1984

  277. [286]

    Cormen, T. H. and Leiserson, C. E. and Rivest, R. L. and Stein, C. , citeulike-article-id =. Introduction to Algorithms , year =

  278. [287]

    and Colbourn, Charles J

    Clark, Brent N. and Colbourn, Charles J. and Johnson, David S. , title =. Discrete Math. , volume =. 1990 , issn =. doi:http://dx.doi.org/10.1016/0012-365X(90)90358-O , publisher =

    1990 doi

  279. [288]

    , title =

    Baker, Brenda S. , title =. J. ACM , volume =. 1994 , issn =. doi:http://doi.acm.org/10.1145/174644.174650 , publisher =

    1994

  280. [289]

    , title =

    Paschos, Vangelis T. , title =. ACM Comput. Surv. , volume =. 1997 , issn =. doi:http://doi.acm.org/10.1145/254180.254190 , publisher =

    1997

  281. [290]

    L. Lov?sz. On the ratio of optimal integral and fractional covers. Discrete Mathematics. 1975. doi:DOI: 10.1016/0012-365X(75)90058-8

    1975 doi

  282. [291]

    , citeulike-article-id =

    Chvatal, V. , citeulike-article-id =. A Greedy Heuristic for the Set-Covering Problem , volume =. Mathematics of Operations Research , keywords =

  283. [292]

    , title =

    Johnson, David S. , title =. STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing , year =. doi:http://doi.acm.org/10.1145/800125.804034 , publisher =

  284. [293]

    1981 , order_no =

    Supowit, Kenneth Jay , title =. 1981 , order_no =

    1981

  285. [294]

    Masuyama, T

    S. Masuyama, T. Ibaraki, T. Hasegawa , title =. Trans. IECE of Japan , volume =. 1981 , pages =

    1981

  286. [295]

    Fowler and Mike Paterson and Steven L

    Robert J. Fowler and Mike Paterson and Steven L. Tanimoto , title =. Inf. Process. Lett. , volume =. 1981 , pages =

    1981

  287. [296]

    , title =

    Johnson, D.S. , title =. Journal of Algorithms , volume =. 1982 , pages =

    1982

  288. [297]

    SIAM Journal of Computing , volume =

    Lichtenstein, David , title =. SIAM Journal of Computing , volume =. 1982 , pages =

    1982

  289. [298]

    Dyer, M E and Frieze, A M , title =. J. Algorithms , volume =. 1986 , issn =. doi:http://dx.doi.org/10.1016/0196-6774(86)90002-7 , publisher =

    1986 doi

  290. [299]

    Nordic J

    Telle, Jan Arne , title =. Nordic J. of Computing , volume =. 1994 , issn =

    1994

  291. [300]

    Hoffmann , title =

    Ioannis Fudos University and Ioannis Fudos and Christoph M. Hoffmann , title =. ACM Transactions on Graphics , year =

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.