scholarly journals An SLD-Resolution Calculus for Basic Serial Multimodal Logics

2005 ◽  
pp. 151-165 ◽  
Author(s):  
Linh Anh Nguyen
Keyword(s):  
Sld Resolution ◽  
Multimodal Logics ◽  
Resolution Calculus

Magic Sets vs. SLD-Resolution

1996 ◽  
pp. 185-203 ◽  
Author(s):  
Stefan Brass
Keyword(s):  
Magic Sets ◽  
Sld Resolution

scholarly journals Modal context restriction for multiagent BDI logics

2021 ◽  
Author(s):  
Marcin Dziubiński
Keyword(s):  
Multiagent Systems ◽  
Modal Logics ◽  
Satisfiability Problem ◽  
Language Restriction ◽  
Multimodal Logics ◽  
Fix Point

AbstractWe present and discuss a novel language restriction for modal logics for multiagent systems, called modal context restriction, that reduces the complexity of the satisfiability problem from EXPTIME complete to NPTIME complete. We focus on BDI multimodal logics that contain fix-point modalities like common beliefs and mutual intentions together with realism and introspection axioms. We show how this combination of modalities and axioms affects complexity of the satisfiability problem and how it can be reduced by restricting the modal context of formulas.

Chapter 29. Theory of Quantified Boolean Formulas

2021 ◽  
Author(s):  
Hans Kleine Büning ◽  
Uwe Bubeck
Keyword(s):  
Normal Form ◽  
Boolean Function ◽  
Expressive Power ◽  
Modeling Language ◽  
Complex Problems ◽  
Quantified Boolean Formulas ◽  
Horn Formulas ◽  
Boolean Formulas ◽  
Function Models ◽  
Resolution Calculus

Quantified Boolean formulas (QBF) are a generalization of propositional formulas by allowing universal and existential quantifiers over variables. This enhancement makes QBF a concise and natural modeling language in which problems from many areas, such as planning, scheduling or verification, can often be encoded in a more compact way than with propositional formulas. We introduce in this chapter the syntax and semantics of QBF and present fundamental concepts. This includes normal form transformations and Q-resolution, an extension of the propositional resolution calculus. In addition, Boolean function models are introduced to describe the valuation of formulas and the behavior of the quantifiers. We also discuss the expressive power of QBF and provide an overview of important complexity results. These illustrate that the greater capabilities of QBF lead to more complex problems, which makes it interesting to consider suitable subclasses of QBF. In particular, we give a detailed look at quantified Horn formulas (QHORN) and quantified 2-CNF (Q2-CNF).

scholarly journals Logical reduction of metarules

2019 ◽  
Vol 109 (7) ◽  
pp. 1323-1369
Author(s):  
Andrew Cropper ◽  
Sophie Tourret
Keyword(s):  
Logic Programming ◽  
Open Problem ◽  
Inductive Logic Programming ◽  
Inductive Logic ◽  
Learning Task ◽  
Reduction Technique ◽  
Trade Off ◽  
Hypothesis Space ◽  
General Derivation ◽  
Sld Resolution

AbstractMany forms of inductive logic programming (ILP) use metarules, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of logical reduction: subsumption and entailment. We also consider a new reduction technique called derivation reduction, which is based on SLD-resolution. We compute reduced sets of metarules for fragments relevant to ILP and theoretically show whether these reduced sets are reductions for more general infinite fragments. We experimentally compare learning with reduced sets of metarules on three domains: Michalski trains, string transformations, and game rules. In general, derivation reduced sets of metarules outperform subsumption and entailment reduced sets, both in terms of predictive accuracies and learning times.

scholarly journals Narrowing vs. SLD-resolution

1988 ◽  
Vol 59 (1-2) ◽  
pp. 3-23 ◽  
Author(s):  
Pier Giorgio Bosco ◽  
Elio Giovannetti ◽  
Corrado Moiso
Keyword(s):  
Sld Resolution

scholarly journals Heterogeneous SLD resolution

1984 ◽  
Vol 1 (4) ◽  
pp. 297-303 ◽  
Author(s):  
Lee Naish
Keyword(s):  
Sld Resolution

scholarly journals Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs

2009 ◽  
Vol 225 ◽  
pp. 141-159 ◽  
Author(s):  
Ekaterina Komendantskaya ◽  
Anthony Karel Seda
Keyword(s):  
Logic Programs ◽  
Sld Resolution ◽  
Annotated Logic
Sign in / Sign up

Export Citation Format

Share Document