Foobar

Known as: Foo bar, Bar, Fooian 
The terms foobar (/ˈfuːbɑːr/), or foo and others are used as placeholder names (also referred to as metasyntactic variables) in computer programming… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2016
051019872016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Both the Beth definability theorem and Craig’s lemma (interpolation theorem from now on) deal with the issue of the entanglement… (More)
Is this relevant?
2009
2009
Foo Cheung,a,1 Martin Trick,b,1 Nizar Drou,b Yong Pyo Lim,c Jee-Young Park,d Soo-Jin Kwon,d Jin-A Kim,d Rod Scott,e J. Chris… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
6LoWPAN is a protocol definition to enable IPv6 packets to be carried on top of low power wireless networks, specifically IEEE… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
In the process of extending the UML metamodel for a specific domain, the metamodel specifier introduces frequently some… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2005
2005
As a promising formulation to represent and reason about agents’ dynamic behavious, logic program updates have been considerably… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present an extensible framework for defining and using “static interfaces” in C++. Static interfaces are especially useful as… (More)
Is this relevant?
1995
1995
Since Hanks and McDermott raised the problem of temporal projection (e.g. the Yale shooting problem) and showed that classical… (More)
Is this relevant?
1994
1994
In order to reason about the real world, intelligent systems must have ways of dealing with incomplete and inconsistent… (More)
  • figure 2.1
  • figure 5.1
Is this relevant?
1994
1994
Many AI systems involve state change: dynamic planning systems need to predict resulting states after state transitions in terms… (More)
  • figure 2.1
Is this relevant?
1991
1991
A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop… (More)
Is this relevant?