Extending LogicWeb via Hereditary Harrop Formulas

Kwon, Keehang; Kang, Dae-Seong

doi:10.1093/ietisy/e91-d.6.1827

Cited by 3 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It must be able to deal with name scoping or local constants to support information hiding. A language called first-order hereditary Harrop formulas (f ohh) [12,13,11] has been extensively studied. This language offers modularity abstraction with local constants.…”

Section: Logicwebmentioning

confidence: 99%

See 1 more Smart Citation

Sequential Operations in LogicWeb

Kang¹,

Kwon²,

Mahmud³

2014

Preprint

View full text Add to dashboard Cite

Sequential tasks cannot be effectively handled in logic programming based on classical logic or linear logic. This limitation can be addressed by using a fragment of Japaridze's computability logic. We propose SeqWeb, an extension to LogicWeb with sequential goal formulas. SeqWeb extends the LogicWeb by allowing goals of the form G ∧ s G and G ∨ s G where G is a goal. These goals allow us to specify both sequential-conjunctive and sequentialdisjunctive tasks.

show abstract

Section: Logicwebmentioning

confidence: 99%

“…This paper proposes Sequential LogicWeb (SeqWeb), an extension of Log-icWeb [11] with sequentiality in goal formulas. Traditionally, LogicWeb has the problem of expressing sequential tasks.…”

Section: Contributions Of This Papermentioning

confidence: 99%

Sequential Operations in LogicWeb

Kang¹,

Kwon²,

Mahmud³

2014

Preprint

View full text Add to dashboard Cite

show abstract

“…Internet computing is an important modern programming paradigm. One successful attempt towards this direction is LogicWeb [3], [4]. LogicWeb is a model of the World Wide Web, where web pages are represented as logic programs, and hypertext links represents logical implications between these programs.…”

Section: Introductionmentioning

confidence: 99%

Towards a Decidable LogicWeb via Length-Bounded Derivations

Kwon,

Kang

2017

Preprint

View full text Add to dashboard Cite

LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we propose a novel module language for logic programming as a device for structuring programs and queries.

show abstract

“…Within this setting, knowledges are expressed as a logic of facts. Many KRs in AI textbooks and papers [8] have been written in boolean logic. However, boolean logic is too simple to represent an important aspect of knowledge, i.e., tasks that can be accomplished by the agent.…”

Section: Introductionmentioning

confidence: 99%

Accomplishable Tasks in Knowledge Representation

Kwon,

Park

2013

Preprint

View full text Add to dashboard Cite

Knowledge Representation (KR) is traditionally based on the logic of facts, expressed in boolean logic. However, facts about an agent can also be seen as a set of accomplished tasks by the agent.This paper proposes a new approach to KR: the notion of task logical KR based on Computability Logic. This notion allows the user to represent both accomplished tasks and accomplishable tasks by the agent. This notion allows us to build sophisticated KRs about many interesting agents, which have not been supported by previous logical languages.

show abstract

Extending LogicWeb via Hereditary Harrop Formulas

Cited by 3 publications

References 5 publications

Sequential Operations in LogicWeb

Sequential Operations in LogicWeb

Towards a Decidable LogicWeb via Length-Bounded Derivations

Accomplishable Tasks in Knowledge Representation

Contact Info

Product

Resources

About