English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

First-order model counting (FOMC) is a computational problem that asks tocount the models of a sentence in finite-domain first-order logic. In thispaper, we argue that the capabilities of FOMC algorithms to date are limited bytheir inability to express many types of recursive computations. To enable suchcomputations, we relax the restrictions that typically accompany domainrecursion and generalise the circuits used to express a solution to an FOMCproblem to directed graphs that may contain cycles. To this end, we adapt themost well-established (weighted) FOMC algorithm ForcLift to work with suchgraphs and introduce new compilation rules that can create cycle-inducing edgesthat encode recursive function calls. These improvements allow the algorithm tofind efficient solutions to counting problems that were previously beyond itsreach, including those that cannot be solved efficiently by any other exactFOMC algorithm. We end with a few conjectures on what classes of instancescould be domain-liftable as a result.

Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures