paper-with-me

Papers

Complex Markov Logic Networks: Expressivity and Liftability

2020-02-24 · Ondrej Kuzelka

We study expressivity of Markov logic networks (MLNs). We introduce complex MLNs, which use complex-valued weights, and we show that, unlike standard MLNs with real-valued weights, complex MLNs are fully expressive. We then observe that discrete Fourier transform can be computed using weighted first order model counting (WFOMC) with complex weights and use this observation to design an algorithm for computing relational marginal polytopes which needs substantially less calls to a WFOMC oracle than a recent algorithm.

📄 PDF Abstract BibTeX arXiv:2002.10259

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Domain-Liftability of Relational Marginal Polytopes

2020-01-15 · Ondrej Kuzelka, Yuyi Wang

We study computational aspects of relational marginal polytopes which are statistical relational learning counterparts of marginal polytopes, well-known from probabilistic graphical models. Here, given some first-order l…

Relational Reasoning

On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

2021-10-18 · Marcel Gehrke

For static lifted inference algorithms, completeness, i.e., domain liftability, is extensively studied. However, so far no domain liftability results for temporal lifted inference algorithms exist. In this paper, we clos…

On Exact Sampling in the Two-Variable Fragment of First-Order Logic

2023-02-06 · Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondřej Kuželka

In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al. -- how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the …

Sentence

The Complexity of Bayesian Networks Specified by Propositional and Relational Languages

2016-12-04 · Fabio Gagliardi Cozman, Denis Deratani Mauá

We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; i…

On The Expressivity of Objective-Specification Formalisms in Reinforcement Learning

2023-10-18 · Rohan Subramani, Marcus Williams, Max Heitmann, Halfdan Holm 외

Most algorithms in reinforcement learning (RL) require that the objective is formalised with a Markovian reward function. However, it is well-known that certain tasks cannot be expressed by means of an objective in the M…

Multi-Objective Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)