Name
Abstract | ||
|---|---|---|
The present contribution advances an abstract notion of hybrid logic by supplementing the definition of institution with an additional structure to extract frames. The foundation of logic programming is set in the general framework proposed by defining the basic concepts such as Horn clause, query and solution, and proving fundamental results such as the existence of initial model of Horn clauses and Herbrand's theorem. The abstract results are then applied to hybrid logics with user-defined sharing, where the possible worlds share a common domain and the variables used for quantification are interpreted uniformly across the worlds. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.04.009 | Theoretical Computer Science |
Keywords | Field | DocType |
Institution,Logic programming,Herbrand's theorem,Initiality | Functional logic programming,Discrete mathematics,Hybrid logic,Combinatorics,Horn clause,Algebra,Horn-satisfiability,Herbrand's theorem,Prolog,Ground expression,Logic programming,Mathematics | Journal |
Volume | ISSN | Citations |
686 | 0304-3975 | 1 |
PageRank | References | Authors |
0.35 | 21 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Găină | 1 | 42 | 5.30 |