1020 search results - page 152 / 204 » Tight Semantics for Logic Programs |
LPNMR
2007
Springer
15 years 6 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
126
click to vote
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
LPNMR
1990
Springer
15 years 3 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
111
click to vote
KES
2006
Springer
14 years 11 months ago
2006
Springer
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
102
click to vote
IJCAI
1993
15 years 1 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...