activity
20132019
most citedComputing LPMLN Using ASP and MLN Solvers

11 citations · 17 across the 6 of their papers we have counts for

collaborators
Showing cs.AIShow all

8 papers · 1 filter

cs.AI2019

Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language

Yi Wang, Shiqi Zhang, Joohyung Lee

To be responsive to dynamically changing real-world environments, an intelligent agent needs to perform complex sequential decision-making tasks that are often guided by commonsens…

cs.AI2019

Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language pBC+

Yi Wang, Joohyung Lee

We extend probabilistic action language pBC+ with the notion of utility as in decision theory. The semantics of the extended pBC+ can be defined as a shorthand notation for a decis…

cs.AI2018

Weight Learning in a Probabilistic Extension of Answer Set Programs

Joohyung Lee, Yi Wang

LPMLN is a probabilistic extension of answer set programs with the weight scheme derived from that of Markov Logic. Previous work has shown how inference in LPMLN can be achieved.…

cs.AI2018

Translating LPOD and CR-Prolog2 into Standard Answer Set Programs

Joohyung Lee, Zhun Yang

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog2 is an…

cs.AI2018

A Probabilistic Extension of Action Language BC+

Joohyung Lee, Yi Wang

We present a probabilistic extension of action language BC+. Just like BC+ is defined as a high-level notation of answer set programs for describing transition systems, the propose…

cs.AI20171 cited

Representing Hybrid Automata by Action Language Modulo Theories

Joohyung Lee, Nikhil Loney, Yunsong Meng

Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to…