778 search results - page 34 / 156 » Expressiveness and complexity of graph logic |
116
click to vote
ISPA
2007
Springer
15 years 6 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
124
click to vote
ASP
2005
Springer
15 years 6 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
105
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
88
Voted
SYNTHESE
2008
15 years 12 days ago
2008
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
205
Voted
ACST
2006
15 years 1 months ago
2006
Including mathematical expressions in documents can be a tiresome and difficult process. A recognition system for handwritten mathematical expressions would greatly simplify the t...